A comparison of integer and constraint programming models for the deficiency problem

DOI10.1016/j.cor.2015.10.016zbMath1349.05099OpenAlexW2172842020MaRDI QIDQ342299

Gilles Caporossi, Sivan Altinakar, Alain Hertz

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.10.016

zbMATH Keywords

integer linear programmingconstraint programmingcompact edge-colorings

Mathematics Subject Classification ID

Integer programming (90C10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Further results on the deficiency of graphs ⋮ Integer programming models for the routing and spectrum allocation problem ⋮ Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs ⋮ Symmetry Breaking Constraints for the Minimum Deficiency Problem ⋮ Cyclic deficiency of graphs

Uses Software

• nauty
• Traces

Cites Work

• Lower bounds and a tabu search algorithm for the minimum deficiency problem
• On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs
• On the deficiency of bipartite graphs
• Investigation on interval edge-colorings of graphs
• The deficiency of a regular graph
• Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs
• Compact Scheduling In Open Shop With Zero-One Time Operations
• Consecutive colorings of the edges of general graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A comparison of integer and constraint programming models for the deficiency problem