The maximum-impact coloring polytope

DOI10.1111/ITOR.12265MaRDI QIDQ2968505zbMATH OpenOpenAlexFDO

Authors Mónica Braga, Diego Delle Donne, Rodrigo Linfati, Javier Marenco

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

zbMATH Keywords

coloringfacetsinteger programming

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• Facet-generating procedures for the maximum-impact coloring polytope
• A polyhedral approach for graph coloring
• A cutting plane algorithm for graph coloring
• An integer programming approach to b-coloring
• Facets of the graph coloring polytope

Cites work

• A branch-and-cut algorithm for graph coloring
• A branch-and-cut procedure for the Udine course timetabling problem
• A Column Generation Approach for Graph Coloring
• A cutting plane algorithm for graph coloring
• A supernodal formulation of vertex colouring with applications in course timetabling
• An exact approach for the vertex coloring problem
• An integer programming formulation for a case study in university timetabling.
• An introduction to timetabling
• Cliques, holes and the vertex coloring polytope
• Curriculum based course timetabling: new solutions to Udine benchmark instances
• Efficient algorithms for finding critical subgraphs
• Exact solution of graph coloring problems via constraint programming and column generation
• Facets of the graph coloring polytope
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1440124 (Why is no real title available?)
• Integer programming methods for large-scale practical classroom assignment problems
• On the asymmetric representatives formulation for the vertex coloring problem
• Precoloring extension. I: Interval graphs
• Safe lower bounds for graph coloring
• Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results

Cited in

(3)

• Facet-generating procedures for the maximum-impact coloring polytope
• Facet-generating procedures for the maximum-impact coloring polytope
• A polyhedral study of the maximum-impact coloring problem on hypergraphs

This page was built for publication: The maximum-impact coloring polytope

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2968505)