Optimization with binet matrices

Optimization with binet matrices

0.00 Avg rating0 Votes
Article ID: iaor20082755
Country: Netherlands
Volume: 35
Issue: 3
Start Page Number: 345
End Page Number: 352
Publication Date: May 2007
Journal: Operations Research Letters
Authors: , , ,
Keywords: optimization, programming: integer
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.

Reviews

Required fields are marked *. Your email address will not be published.