On the mixed set covering, packing and partitioning polytope
From MaRDI portal
Publication:1751181
DOI10.1016/j.disopt.2016.05.004zbMath1387.90139OpenAlexW2490801269MaRDI QIDQ1751181
Janny M. Y. Leung, Yong-Hong Kuo
Publication date: 24 May 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2016.05.004
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
The matching relaxation for a class of generalized set partitioning problems, Set covering problem with conflict constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lehman's forbidden minor characterization of ideal 0-1 matrices
- The strong perfect graph theorem
- A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
- The train driver recovery problem-a set partitioning based model and solution method
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- On the 0,1 facets of the set covering polytope
- A generalization of antiwebs to independence systems and their canonical facets
- On the facial structure of the set covering polytope
- On stable set polyhedra for K//(1,3)free graphs
- On the complexity of testing for odd holes and induced odd paths
- A class of facet producing graphs for vertex packing polyhedra
- Ideal 0, 1 matrices
- Wheel inequalities for stable set polytopes
- On certain polytopes associated with graphs
- Set packing relaxations of some integer programs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Recognizing Berge graphs
- Anti-blocking polyhedra
- Normal hypergraphs and the perfect graph conjecture
- Edmonds polytopes and a hierarchy of combinatorial problems
- The iterated exponential integers
- Combinatorial Auction Design
- Outline of an algorithm for integer solutions to linear programs
- On the width—length inequality
- Lifting the facets of zero–one polytopes
- Set Partitioning: A survey
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Routing Trains Through Railway Stations: Model Formulation and Algorithms
- Properties of vertex packing and independence system polyhedra
- Perfect zero–one matrices
- On the facial structure of set packing polyhedra
- Odd Hole Recognition in Graphs of Bounded Clique Size
- Maximum matching and a polyhedron with 0,1-vertices
- Balanced matrices
- Blocking and anti-blocking pairs of polyhedra
- Matroids and the greedy algorithm
