A comparison of integer and constraint programming models for the deficiency problem
From MaRDI portal
Publication:342299
DOI10.1016/J.COR.2015.10.016zbMATH Open1349.05099OpenAlexW2172842020MaRDI QIDQ342299FDOQ342299
Authors: Sivan Altinakar, Gilles Caporossi, 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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Integer programming (90C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- On the deficiency of bipartite graphs
- Investigation on interval edge-colorings of graphs
- The deficiency of a regular graph
- On interval colourings of bi-regular bipartite graphs
- Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Consecutive colorings of the edges of general graphs
- On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs
- Compact Scheduling In Open Shop With Zero-One Time Operations
- Lower bounds and a tabu search algorithm for the minimum deficiency problem
Cited In (7)
- Integer programming models for the routing and spectrum allocation problem
- Cyclic deficiency of graphs
- Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs
- Symmetry Breaking Constraints for the Minimum Deficiency Problem
- Compact cyclic edge-colorings of graphs
- Lower bounds and a tabu search algorithm for the minimum deficiency problem
- Further results on the deficiency of graphs
Uses Software
This page was built for publication: A comparison of integer and constraint programming models for the deficiency problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342299)
