„linear programming algorithms“

Suchergebnisse

203 Treffer

• Improved Lower Bounds on Multiflow-Multicut Gaps
  Kalantarzadeh, Sina ; Kumar, Nikhil 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computational Logistics – 9th International Conference, ICCL 2018, Vietri sul Mare, Italy, October 1–3, 2018, Proceedings
  Cerulli, Raffaele 2018 Springer International Publishing
• Practical Mathematical Optimization – An Introduction to Basic Optimization Theory and Classical and New Gradient-Based Algorithms
  2005 Springer US
• Advances in Stochastic and Deterministic Global Optimization
  Pardalos, Panos M. ; Žigljavskij, Anatolij Aleksandrovič ; Žilinskas, Julius 2016 Springer International Publishing
• A (3/2 + 1/e)-Approximation Algorithm for Ordered TSP
  Mnich, Matthias ; Armbruster, Susanne ; Nägele, Martin 2024 Technische Universität Hamburg. Universitätsbibliothek
• Linear-Space Subquadratic-Time String Alignment Algorithm for Arbitrary Scoring Matrices
  Yamano, Ryosuke ; Shibuya, Tetsuo 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Integer Programming
  Conforti, Michele ; Cornuéjols, Gérard ; Zambelli, Giacomo 1991 Springer Netherlands
• Algorithms, Probability, Networks, and Games – Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday
  Zaroliagis, Christos ; Pantziou, Grammati ; Kontogiannis, Spyros C. 2015 Springer International Publishing
• Optimization and Its Applications in Control and Data Sciences – In Honor of Boris T. Polyak’s 80th Birthday
  Goldengorin, Boris 2016 Springer International Publishing
• Sustainable Logistics and Transportation – Optimization Models and Algorithms
  Cinar, Didem ; Gakis, Konstantinos ; Pardalos, Panos M. 2017 Springer International Publishing
• Practically Feasible Proof Logging for Pseudo-Boolean Optimization
  Koops, Wietze ; Le Berre, Daniel ; Myreen, Magnus O. ; Nordström, Jakob ; Oertel, Andy ; Tan, Yong Kiam ; Vinyals, Marc 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximative Algorithmen und Nichtapproximierbarkeit
  Jansen, Klaus ; Margraf, Marian 2008 De Gruyter
• Fast Algorithms for Quantile Regression with Selection
  Pereda-Fernández, Santiago
• New Results on a General Class of Minimum Norm Optimization Problems
  Chen, Kuowen ; Li, Jian ; Rabani, Yuval ; Zhang, Yiran 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• DynASP2.5: Dynamic Programming on Tree Decompositions in Action
  Fichte, Johannes Klaus ; Hecher, Markus ; Morak, Michael ; Woltran, Stefan 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Constant Approximation Algorithm for Scheduling Packets on Line Networks
  Even, Guy ; Medina, Moti ; Rosén, Adi 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Modeling decisions for artificial intelligence – 9th international conference ; proceedings
  Torra, Vicenç ; Narukawa, Yasuo ; Lopez, Beatriz ; Villaret, Mateu 2012 Springer
• Non-linear Integer Programming Model and Algorithms for Connected p-facility Location Problem
  Zhu, Jianming
• A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
  Li, Qian ; Ouyang, Minghui ; Wang, Yuyi 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Scheduling Splittable Jobs on Configurable Machines
  Casey, Matthew ; Rajaraman, Rajmohan ; Stalfa, David ; Tan, Cheng 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik