## Integer Programming and Combinatorial Optimization: 6th International IPCO Conference Houston, Texas, June 22–24, 1998 ProceedingsRobert E. Bixby, Andrew E. Boyd, Roger Z. Rios-Mercado This volume contains the papers selected for presentationat IPCO VI, the Sixth InternationalConferenceonInteger ProgrammingandCombinatorialOptimi- tion, held inHouston, Texas, USA, June22{24,1998.TheIPCOseriesofconf- ences highlights recent developments in theory, computation, and applications of integer programming and combinatorial optimization. These conferences are sponsoredby the Mathematical ProgrammingSociety, and are held in the years in which no International Symosium on Mathema- cal Programming takes place. Earlier IPCO conferences were held in Waterloo (Canada) in May 1990; Pittsburgh (USA) in May 1992; Erice (Italy) in April 1993; Copenhagen (Denmark) in May 1995; and Vancouver (Canada) in June 1996. The proceedings of IPCO IV (edited by Egon Balas and Jens Clausen in 1995) and IPCO V (edited by William Cunningham, Thomas McCormick, and Maurice Queyranne in 1996), were published by Springer-Verlag in the series Lecture Notes in Computer Science as Volumes 920 and 1084, respectively. The proceedings of the rst three IPCO conferences were published by organizing institutions. A total of77 extended abstracts, mostly of an excellentquality, wereinitially submitted. Following the IPCO policy of having only one stream of sessions over a three day span, the ProgramCommittee selected 32 papers. As a result, many outstanding papers could not be selected. The papers included in this volume have not been refereed. It is expected that revised versions of these works will appear in scienti c journals. The Program Committee thanks all the authors of submitted extended - stracts and papers for their support of the IPCO conferences. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

The Packing Property | 1 |

Bipartite Designs | 23 |

Characterizing Noninteger Polyhedra with 01 Constraints | 37 |

Copyright | |

24 other sections not shown

### Other editions - View all

### Common terms and phrases

2-edge connected adjacent approximation algorithms arcs augmenting augmenting path bidirected graph bipartite cactus called chordless cycle clutter column combinatorial components Computer Conjecture connected graph consider constraints contains convex combination Corollary corresponding CPLEX cutting plane define denote disjunctive E. A. Boyd ear decomposition facet facility feasible set inequality feasible solution flow problem fractional given graph G Hence heuristic instances integer programming iteration labeled Lemma Lenstra Let G linear programming list scheduling lower bound LP relaxation machines matrix matroid maximum flow maximum flow problem minimum cuts multicommodity flow neighbors node NP-hard obtained optimal flow optimal solution packing pair partition path planar graph polyhedral polyhedron polynomial polynomial-time polytope Proof prove pseudoflow R. E. Bixby randomized rounding rows satisfies scheduling problems Shmoys solved splitting subgraph subset subtour Theorem tree Unrestricted Vertex Multicut variables vector vertex vertices weight