Solving a multicoloring problem with overlaps using integer programming

DOI10.1016/J.DAM.2009.05.007zbMATH Open1225.05099OpenAlexW2071281347MaRDI QIDQ968150FDOQ968150

Isabel Méndez-Díaz, Paula Zabala

Publication date: 5 May 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.05.007

Recommendations

• A Branch-And-Price Approach for Graph Multi-Coloring
• A cutting plane algorithm for graph coloring
• A polyhedral approach for graph coloring
• A branch-and-price approach for the partition coloring problem
• A branch-and-cut algorithm for graph coloring

zbMATH Keywords

integer programmingbranch-and-cutgraph multicoloring

Mathematics Subject Classification ID

Integer programming (90C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• A branch-and-cut algorithm for graph coloring
• A Column Generation Approach for Graph Coloring
• Models and solution techniques for frequency assignment problems
• On a binary-encoded ILP coloring formulation
• A Branch-And-Price Approach for Graph Multi-Coloring
• Mathematical Foundations of Computer Science 2004

Cited In (1)

• An integer programming approach to b-coloring

Uses Software

• CALMA

This page was built for publication: Solving a multicoloring problem with overlaps using integer programming

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