| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143296 | Operations Research Letters | 2007 | 8 Pages |
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 Chvátal rank 1.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gautam Appa, Balázs Kotnyek, Konstantinos Papalamprou, Leonidas Pitsoulis,