scientific article; zbMATH DE number 2230274
From MaRDI portal
Publication:5708566
zbMath1075.90561MaRDI QIDQ5708566
Publication date: 18 November 2005
Full work available at URL: http://www.sciencedirect.com/science/journal/15710653
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- A generalization of antiwebs to independence systems and their canonical facets
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Weakly bipartite graphs and the max-cut problem
- Geometric algorithms and combinatorial optimization
- A class of facet producing graphs for vertex packing polyhedra
- Separating subdivision of bicycle wheel inequalities over cut polytopes
- Wheel inequalities for stable set polytopes
- Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra
- Design and Implementation of an Interactive Optimization System for Telephone Network Planning
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- On the cut polytope
This page was built for publication:
