An integer programming approach to b-coloring
From MaRDI portal
Publication:2419584
DOI10.1016/j.disopt.2018.12.001zbMath1506.05074OpenAlexW2905146877WikidataQ128781139 ScholiaQ128781139MaRDI QIDQ2419584
Publication date: 14 June 2019
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2018.12.001
Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Upper and lower bounds based on linear programming for the b-coloring problem ⋮ New Steiner 2-designs from old ones by paramodifications ⋮ A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic
Cites Work
- Unnamed Item
- An exact approach for the vertex coloring problem
- Hybrid evolutionary algorithm for the b-chromatic number
- A supernodal formulation of vertex colouring with applications in course timetabling
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
- Cliques, holes and the vertex coloring polytope
- The b-chromatic number of a graph
- The \(b\)-chromatic number and related topics -- a survey
- \(b\)-coloring of tight graphs
- Facets of the graph coloring polytope
- The \(b\)-chromatic index of direct product of graphs
- On the \(b\)-continuity property of graphs
- A cutting plane algorithm for graph coloring
- 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: An integer programming approach to b-coloring
