Optimization with binet matrices

Appa, Gautam and Kotnyek, Balázs (2003) Optimization with binet matrices. Operational Research working papers (LSEOR 03.59). Department of Operational Research, London School of Economics and Political Science, London, UK.

Preview

PDF Download (303kB) | Preview

Abstract

This paper deals with linear and integer programming problems in which the constraint matrix is a binet matrix. Binet matrices are pivoted versions of the node-edge incidence matrices of bidirected graphs. It is shown that efficient methods are available to solve such optimization problems. 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. An example of binet matrices, namely matrices with at most three non-zeros per row, is given.

Item Type:	Monograph (Working Paper)
Official URL:	http://www.lse.ac.uk/collections/operationalResear...
Additional Information:	© 2003 London School of Economics and Political Science
Divisions:	LSE
Subjects:	Q Science > QA Mathematics
Date Deposited:	06 Mar 2009 16:20
Last Modified:	13 Sep 2024 19:49
URI:	http://eprints.lse.ac.uk/id/eprint/22768

Actions (login required)

View Item