Faster separation of 1-wheel inequalities by graph products

DOI10.1016/j.dam.2014.07.027zbMath1320.05100OpenAlexW1969371412MaRDI QIDQ496437

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

zbMATH Keywords

stable setwheelseparation algorithmgraph product

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

An extended formulation for the 1‐wheel inequalities of the stable set polytope

Cites Work

• Weakly bipartite graphs and the max-cut problem
• Geometric algorithms and combinatorial optimization
• Wheel inequalities for stable set polytopes
• Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut
• Design and Implementation of an Interactive Optimization System for Telephone Network Planning
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Separation problems for the stable set polytope
• On the facial structure of set packing polyhedra
• Fibonacci heaps and their uses in improved network optimization algorithms

This page was built for publication: Faster separation of 1-wheel inequalities by graph products