„linear programming algorithms“

Suchergebnisse

1.000+ Treffer

• Beating Ratio 0.5 for Weighted Oblivious Matching Problems
  Abolhassani, Melika ; Chan, T.-H. Hubert ; Chen, Fei ; Esfandiari, Hossein ; Hajiaghayi, MohammadTaghi ; Hamid, Mahini ; Wu, Xiaowei 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• 50 Years of Integer Programming 1958-2008 – From the Early Years to the State-of-the-Art
  Jünger, Michael ; Liebling, Thomas M. ; Naddef, Denis ; Nemhauser, George L. ; Pulleyblank, William R. ; Reinelt, Gerhard ; Rinaldi, Giovanni ; Wolsey, Laurence A. 2009 Springer Berlin Heidelberg
• Refinement algorithms for time-dependent discrete optimization problems
  Gnegel, Fabian ; Fügenschuh, Armin ; Lorenz, Ulf ; Köhler, Ekkehard 2022 BTU Cottbus - Senftenberg
• Optimization of Energy System Design and Operation using Multi-Objective Evolutionary Algorithms and Mixed-Integer Linear Programming
  Kaldemeyer, Cord 2021 Zentrale Hochschulbibliothek Flensburg
• Exact Optimization Algorithms for the Aggregation of Spatial Data
  Oehrlein, Johannes 2020 Universitäts- und Landesbibliothek Bonn
• Investigating Robustness, Public Transport Optimization, and their Interface – Mathematical Models and Solution Algorithms
  Pätzold, Julius ; Schöbel, Anita ; Goerigk, Marc 2019 Niedersächsische Staats- und Universitätsbibliothek Göttingen
• Railway Track Allocation: Models and Algorithms
  Schlechte, Thomas ; Grötschel, Martin 2012 Universitätsbibliothek der Technischen Universität Berlin
• Improved Upper Bounds on Multiflow-Multicut Gaps in Cactus Graphs
  Kalantarzadeh, Sina ; Kumar, Nikhil 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Integrating concepts from constraint programming and operations research algorithms
  Fahle, Torsten
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques – 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings
  Raghavendra, Prasad ; Raskhodnikova, Sofya ; Jansen, Klaus ; Rolim, José D.P. 2013 Springer Berlin Heidelberg
• Modeling Decisions for Artificial Intelligence – 9th International Conference, MDAI 2012, Girona, Catalonia, Spain, November 21-23, 2012. Proceedings
  Torra, Vicenç ; Narukawa, Yasuo ; Lopez, Beatriz ; Villaret, Mateu 2012 Springer Berlin Heidelberg
• Theory and Practice of Algorithms in (Computer) Systems – First International ICST Conference, TAPAS 2011, Rome, Italy, April 18-20, 2011. Proceedings
  Marchetti-Spaccamela, Alberto ; Segal, Michael 2011 Springer Berlin Heidelberg
• A Genetic-Based Search for Adaptive Table Recognition in Spreadsheets
  Lehner, Wolfgang ; Koci, Elvis ; Thiele, Maik ; Romero, Oscar 2023 Technische Universität Dresden
• Exact and fast algorithms for mixed-integer nonlinear programming
  Gleixner, Ambros M. ; Grötschel, Martin ; Koch, Thorsten ; Lodi, Andrea 2015 Technische Universität Berlin
• Long-step primal-dual target-following algorithms for linear programming
  Jansen, Benjamin ; Roos, Ccs ; Terlaky, Tamás ; Vial, Jean-Philippe
• Erratum: A Correction to ``Parallel Approximation Algorithms by Positive Linear Programming''
  Trevisan, L.
• Weight Reduction in Distributed Protocols: New Algorithms and Analysis
  Zinovyev, Anatoliy 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Visualization of Event Graphs for Train Schedules
  Hartleb, Johann ; Schmidt, Marie ; Wolf, Samuel ; Wolff, Alexander 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Dual Charging for Half-Integral TSP
  Klein, Nathan ; Taziki, Mehrshad 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Randomized Rounding Approach for DAG Edge Deletion
  Kalantarzadeh, Sina ; Klein, Nathan ; Reis, Victor 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik