Monotonizing linear programs with up to two nonzeroes per column

Authors:
Dorit S. Hochbaum
Affiliations:
Department of Industrial Engineering and Operations Research, Walter A. Haas School of Business, University of California, Berkeley, CA 94720, USA
Venue:
Operations Research Letters
Year:
2004

Citing 14
Cited 3

The computational complexity of simultaneous diophantine approximation problems

SIAM Journal on Computing
Sensitivity theorems in integer linear programming

Mathematical Programming: Series A and B
A polynomial algorithm for b-matchings: an alternative approach

Information Processing Letters
A strongly polynomial algorithm for a special class of linear programs

Operations Research
A faster strongly polynomial minimum cost flow algorithm

Operations Research
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality

Mathematical Programming: Series A and B
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality

SIAM Journal on Computing
Improved Algorithms for Linear Inequalities with Two Variables per Inequality

SIAM Journal on Computing
An approximation algorithm for the generalized assignment problem

Mathematical Programming: Series A and B
New algorithms for generalized network flows

Mathematical Programming: Series A and B
Combinatorial optimization

Combinatorial optimization
Combinatorial approximation algorithms for generalized flow problems

Journal of Algorithms
A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow

Mathematics of Operations Research
New approaches for optimizing over the semimetric polytope

Mathematical Programming: Series A and B

An analytical approach to the inference of summary data of additive type

Theoretical Computer Science
Ab initio whole genome shotgun assembly with mated short reads

RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
The two variable per inequality abstract domain

Higher-Order and Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linear programming problems with up to two nonzeroes per column in the constraint matrix are shown equivalent to generalized network flow problem. The transformation is applied for solving the maximum cut problem, the b-matching problem in strongly polynomial time and for approximation algorithms for certain integer versions of the problem.