Appa, Gautam, Kotnyek, Balázs, Papalamprou, Konstantinos and Pitsoulis, Leonidas (2007) Optimization with binet matrices. Operations research letters, 35 (3). pp. 345-352. ISSN 0167-6377
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.
|Additional Information:||© 2007 Elsevier|
|Library of Congress subject classification:||Q Science > QA Mathematics|
|Sets:||Research centres and groups > Management Science Group
Departments > Management
Actions (login required)
|Record administration - authorised staff only|