Location of Repository

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

Topics:
QA Mathematics

Publisher: Department of Operational Research, London School of Economics and Political Science

Year: 2003

OAI identifier:
oai:eprints.lse.ac.uk:22768

Provided by:
LSE Research Online

Download PDF:- (2003). A bidirected generalization of network matrices. submitted to Networks,
- (2002). A generalization of totally unimodular and network matrices.
- (1986). A strongly polynomial algorithm to solve combinatorial linear programs.
- (1967). An introduction to matching. Mimeographed notes,
- (1976). Combinatorial Optimization: Networks and Matroids.
- (1974). Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network ﬂow problem.
- (1988). Integer and Combinatorial Optimization.
- (1992). Locating competitive new facilities in the presence of existing facilities.
- (1970). Matching: a well-solved class of integer linear programs.
- (1986). Matrices with the Edmonds-Johnson property.
- (1993). Network Flows.
- (1992). Network Programming.
- (2003). Rational and integral k-regular matrices. Discrete Mathematics,
- (2002). Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.