Faster separation of 1-wheel inequalities by graph products
DOI10.1016/J.DAM.2014.07.027zbMATH Open1320.05100OpenAlexW1969371412MaRDI QIDQ496437FDOQ496437
Authors: Sven De Vries 
Publication date: 21 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.07.027
Recommendations
- Separation problems for the stable set polytope
- Wheel inequalities for stable set polytopes
- Antiweb-wheel inequalities and their separation problems over the stable set polytopes
- On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes
- Separating subdivision of bicycle wheel inequalities over cut polytopes
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Fibonacci heaps and their uses in improved network optimization algorithms
- Geometric algorithms and combinatorial optimization
- Efficient Algorithms for Shortest Paths in Sparse Networks
- On the facial structure of set packing polyhedra
- Solving a truck dispatching scheduling problem using branch-and-cut
- Weakly bipartite graphs and the max-cut problem
- Wheel inequalities for stable set polytopes
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- Design and Implementation of an Interactive Optimization System for Telephone Network Planning
- Separation problems for the stable set polytope
Cited In (3)
This page was built for publication: Faster separation of 1-wheel inequalities by graph products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496437)
