Optimization with binet matrices

Authors:
Gautam Appa;BaláZs Kotnyek;Konstantinos Papalamprou;Leonidas Pitsoulis
Affiliations:
Operational Research Department, London School of Economics, Houghton Street, London WC2A 2AE, UK;I3S & Inria Sophia Antipolis, France;Operational Research Department, London School of Economics, Houghton Street, London WC2A 2AE, UK;Department of Mathematical and Physical Sciences, Aristotle University of Thessaloniki, Thessaloniki 54124, Greece
Venue:
Operations Research Letters
Year:
2007

Citing 9
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
Matrices with the Edmonds-Johnson property

Combinatorica
Integer and combinatorial optimization

Integer and combinatorial optimization
Decomposition and optimization over cycles in binary matroids

Journal of Combinatorial Theory Series B
Network programming

Network programming
{0, 12 }-Chva´tal-Gomory cuts

Mathematical Programming: Series A and B
Matching: a well-solved class of integer linear programs

Combinatorial optimization - Eureka, you shrink!
A bidirected generalization of network matrices

Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with linear and integer programming problems in which the constraint matrix is a binet matrix. Linear programs can be solved with the generalized network simplex method, while integer programs are converted to a matching problem. It is also proved that an integral binet matrix has strong Chvatal rank 1.