On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications

DOI10.1007/s10878-018-0291-9zbMath1418.05103OpenAlexW2802715393MaRDI QIDQ1631662

Y. Aharonov

Publication date: 6 December 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-0291-9

zbMATH Keywords

cliqueinterval graphbranch-and-cutpolyhedral analysis

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ A branch-and-cut algorithm for the edge interdiction clique problem

Cites Work

• Unnamed Item
• Parallel machine scheduling with precedence constraints and setup times
• The maximum clique problem
• Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
• A cutting plane algorithm for the unrelated parallel machine scheduling problem
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Algorithmic graph theory and perfect graphs
• Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization
• Representation of a finite graph by a set of intervals on the real line
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Open Shop Scheduling to Minimize Finish Time
• Polyhedral techniques in combinatorial optimization II: applications and computations

This page was built for publication: On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications