The maximum-impact coloring polytope
From MaRDI portal
Publication:2968505
DOI10.1111/itor.12265zbMath1358.90145OpenAlexW2521129005MaRDI QIDQ2968505
Javier Marenco, Diego Delle Donne, Rodrigo Linfati, Mónica Braga
Publication date: 16 March 2017
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12265
Programming involving graphs or networks (90C35) Integer programming (90C10) Coloring of graphs and hypergraphs (05C15)
Related Items (2)
Facet-generating procedures for the maximum-impact coloring polytope ⋮ Facet-generating procedures for the maximum-impact coloring polytope
Cites Work
- Unnamed Item
- Unnamed Item
- Integer programming methods for large-scale practical classroom assignment problems
- An exact approach for the vertex coloring problem
- A supernodal formulation of vertex colouring with applications in course timetabling
- An introduction to timetabling
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
- Cliques, holes and the vertex coloring polytope
- Precoloring extension. I: Interval graphs
- An integer programming formulation for a case study in university timetabling.
- A branch-and-cut procedure for the Udine course timetabling problem
- Curriculum based course timetabling: new solutions to Udine benchmark instances
- Facets of the graph coloring polytope
- A cutting plane algorithm for graph coloring
- Efficient algorithms for finding critical subgraphs
- On the asymmetric representatives formulation for the vertex coloring problem
- A branch-and-cut algorithm for graph coloring
- Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation
- Safe Lower Bounds for Graph Coloring
- A Column Generation Approach for Graph Coloring
This page was built for publication: The maximum-impact coloring polytope
