Transitive Packing: A Unifying Concept in Combinatorial Optimization

DOI10.1137/S1052623499363256zbMath1026.90077MaRDI QIDQ4785885

Rudolf Müller, Andreas S. Schulz

Publication date: 5 January 2003

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationindependence systempolyhedral combinatorics\(0/1\)-polytopeGomory-Chvátal cuttransitive packing

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (5)

Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model ⋮ On the Location and p-Median Polytopes ⋮ Facets from gadgets ⋮ A two-level graph partitioning problem arising in mobile wireless communications ⋮ Projection results for the \(k\)-partition problem

This page was built for publication: Transitive Packing: A Unifying Concept in Combinatorial Optimization