Optimization with binet matrices
Appa, G., Kotnyek, B., Papalamprou, K. & Pitsoulis, L.
(2007).
Optimization with binet matrices.
Operations Research Letters,
35(3), 345-352.
https://doi.org/10.1016/j.orl.2006.04.003
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.
| Item Type | Article |
|---|---|
| Copyright holders | © 2007 Elsevier |
| Departments | LSE > Academic Departments > Management |
| DOI | 10.1016/j.orl.2006.04.003 |
| Date Deposited | 18 Dec 2009 |
| URI | https://researchonline.lse.ac.uk/id/eprint/26494 |
Explore Further
- https://www.scopus.com/pages/publications/34247136775 (Scopus publication)
- http://www.elsevier.com/wps/find/journaldescriptio... (Official URL)