Optimization with additional variables and constraints

DOI10.1016/j.orl.2004.06.006zbMath1140.90466OpenAlexW1992361736MaRDI QIDQ1779712

Alpár Jüttner

Publication date: 1 June 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2004.06.006

zbMATH Keywords

Linear programmingParametric searchStrongly polynomial algorithms

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• Unnamed Item
• Unnamed Item
• The ellipsoid method and its consequences in combinatorial optimization
• The inverse-parametric knapsack problem
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• The maximum concurrent flow problem
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Linear Programming in Linear Time When the Dimension Is Fixed
• Combinatorial Optimization with Rational Objective Functions
• Polynomial algorithms in linear programming
• Using separation algorithms in fixed dimension
• The quickest flow problem
• Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs
• On Linear Characterizations of Combinatorial Optimization Problems

This page was built for publication: Optimization with additional variables and constraints