„linear programming algorithms“

Suchergebnisse

203 Treffer

• Approximating Unique Games Using Low Diameter Graph Decomposition
  Levi Alev, Vedat ; Lau, Lap Chi 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• SDDP for multistage stochastic linear programs based on spectral risk measures
  Guiges, Vincent ; Römisch, Werner 2012 Humboldt-Universität zu Berlin
• Proving Weak Approximability Without Algorithms
  Syed, Ridwan ; Tulsiani, Madhur 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Bi-Criteria Approximation Algorithm for k-Means
  Makarychev, Konstantin ; Makarychev, Yury ; Sviridenko, Maxim ; Ward, Justin 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximation Algorithms for Parallel Machine Scheduling with Speed-up Resources
  Chen, Lin ; Ye, Deshi ; Zhang, Guochuan 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Min-Sum Scheduling Under Precedence Constraints
  Schulz, Andreas S. ; Verschae, José 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Sherali-Adams Gaps, Flow-cover Inequalities and Generalized Configurations for Capacity-constrained Facility Location
  Kolliopoulos, Stavros G. ; Moysoglou, Yannis 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees
  Elbassioni, Khaled ; Garg, Naveen ; Gupta, Divya ; Kumar, Amit ; Narula, Vishal ; Pal, Arindam 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Iterative Methods in Combinatorial Optimization
  Ravi, R. 2009 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improved Approximations for Guarding 1.5-Dimensional Terrains
  Elbassioni, Khaled ; Krohn, Erik ; Matijevic, Domagoj ; Mestre, Julian ; Severdija, Domagoj 2009 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithms for Game Metrics
  Chatterjee, Krishnendu ; de Alfaro, Luca ; Majumdar, Rupak ; Raman, Vishwanath 2008 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Practical Mathematical Optimization – Basic Optimization Theory and Gradient-Based Algorithms
  Snyman, Jan ; Wilke, Daniel N. 2018 Springer International Publishing
• Combinatorial Optimization – Theory and Algorithms
  Korte, Bernhard ; Vygen, Jens 2018 Springer Berlin
• Computational experience with advanced implementation of decomposition algorithms for linear programming
  Ho, J. K. ; Loute, E.
• Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming
  Qian, Zhong-gen ; Bai, Yan-qin
• On the worst case complexity of potential reduction algorithms for linear programming
  Bertsimas, Dimitris ; Luo, Xiaodong
• Volumetric path following algorithms for linear programming
  Anstreicher, Kurt M.
• Disjunctive Programming
  Balas, Egon 2018 Springer International Publishing
• Continuous Nonlinear Optimization for Engineering Applications in GAMS Technology
  Andrei, Neculai 2017 Springer International Publishing
• Parameter Advising for Multiple Sequence Alignment
  DeBlasio, Dan ; Kececioglu, John D. 2017 Springer International Publishing