Optimization with additional variables and constraints

Authors:
AlpáR JüTtner
Affiliations:
Department of Operations Research and Communication Networks Laboratory, Eötvös University, Pázmány Péter Sétány 1/C, Budapest, Hungary, H-1117 and Traffic Analy ...
Venue:
Operations Research Letters
Year:
2005

Citing 6
Cited 0

A strongly polynomial algorithm to solve combinatorial linear programs

Operations Research
Theory of linear and integer programming

Theory of linear and integer programming
Using separation algorithms in fixed dimension

Journal of Algorithms
Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs

Journal of the ACM (JACM)
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
Linear Programming in Linear Time When the Dimension Is Fixed

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Norton, Plotkin and Tardos proved that-loosely spoken, an LP problem is solvable in time O(Tq^k^+^1) if deleting k fixed columns or rows, we obtain a problem which can be solved by an algorithm that makes at most T steps and q comparisons. This paper improves this running time to O(Tq^k).