Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model

DOI10.1016/j.endm.2017.10.025zbMath1383.05097OpenAlexW2765161331MaRDI QIDQ2413162

Rosiane de Freitas, Javier Marenco, Bruno H. Dias, Nelson F. Maculan

Publication date: 9 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.10.025

zbMATH Keywords

integer programmingpolyhedral combinatoricsbandwidth coloring

Mathematics Subject Classification ID

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

Cites Work

• Multistart iterated tabu search for bandwidth coloring problem
• Frequency assignment in cellular phone networks
• Generalised graph colouring by a hybrid of local search and constraint programming
• An evolutionary approach for bandwidth multicoloring problems
• Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
• Polyhedral studies for minimum‐span graph labelling with integer distance constraints

This page was built for publication: Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model