Resource title

Optimization with binet matrices

Resource image

image for OpenScout resource :: Optimization with binet matrices

Resource description

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.

Resource author

Resource publisher

Resource publish date

Resource language

en

Resource content type

Resource resource URL

http://eprints.lse.ac.uk/26494/

Resource license