scientific article; zbMATH DE number 7053354

zbMath1423.05169MaRDI QIDQ5743477

Gianpaolo Oriolo, Yuri Faenza, Gautier Stauffer

Publication date: 10 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=2095218

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Lifts for Voronoi cells of lattices ⋮ Separation routine and extended formulations for the stable set problem in claw-free graphs ⋮ Extended formulations from communication protocols in output-efficient time ⋮ Extended formulations, nonnegative factorizations, and randomized communication protocols ⋮ Stable sets and graphs with no even holes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Projection, lifting and extended formulation integer and combinatorial optimization
• On maximal independent sets of vertices in claw-free graphs
• Geometric algorithms and combinatorial optimization
• A cutting plane algorithm for minimum perfect 2-matchings
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Edmonds polytopes and a hierarchy of combinatorial problems
• A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
• A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
• Branched Polyhedral Systems
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• Odd Minimum Cut-Sets and b-Matchings
• A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: