Discrete relaxations of combinatorial programs

DOI10.1016/S0166-218X(00)00307-3zbMath1054.90048MaRDI QIDQ5946814

Ralf Borndörfer, Robert Weismantel

Publication date: 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Integer programming; Cutting planes; Polyhedral combinatorics

Mathematics Subject Classification ID

90C10: Integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

Cites Work

• Unnamed Item
• The perfectly matchable subgraph polytope of an arbitrary graph
• A note on node packing polytopes on hypergraphs
• On the 0,1 facets of the set covering polytope
• An analytical comparison of different formulations of the travelling salesman problem
• Geometric algorithms and combinatorial optimization
• The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
• The Steiner tree problem. II: Properties and classes of facets
• On the \(0/1\) knapsack polytope
• On certain polytopes associated with graphs
• Set packing relaxations of some integer programs
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• Formulations and valid inequalities of the node capacitated graph partitioning problem
• Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
• (1,k)-configurations and facets for packing problems
• Faces for a linear inequality in 0–1 variables
• On the facial structure of set packing polyhedra
• The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph