An exact algorithm for the edge coloring by total labeling problem
Author
Abstract
Suggested Citation
DOI: 10.1007/s10479-018-2977-x
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Pablo Coll & Javier Marenco & Isabel Méndez Díaz & Paula Zabala, 2002. "Facets of the Graph Coloring Polytope," Annals of Operations Research, Springer, vol. 116(1), pages 79-90, October.
- Karen Aardal & Stan Hoesel & Arie Koster & Carlo Mannino & Antonio Sassano, 2007. "Models and solution techniques for frequency assignment problems," Annals of Operations Research, Springer, vol. 153(1), pages 79-129, September.
- Martin Grötschel & Michael Jünger & Gerhard Reinelt, 1984. "A Cutting Plane Algorithm for the Linear Ordering Problem," Operations Research, INFORMS, vol. 32(6), pages 1195-1220, December.
- Edmund Burke & Jakub Mareček & Andrew Parkes & Hana Rudová, 2012. "A branch-and-cut procedure for the Udine Course Timetabling problem," Annals of Operations Research, Springer, vol. 194(1), pages 71-87, April.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Edmund Burke & Jakub Mareček & Andrew Parkes & Hana Rudová, 2010. "A supernodal formulation of vertex colouring with applications in course timetabling," Annals of Operations Research, Springer, vol. 179(1), pages 105-130, September.
- Natalia Castro & María A. Garrido-Vizuete & Rafael Robles & María Trinidad Villar-Liñán, 2020. "Contrast in greyscales of graphs," Journal of Combinatorial Optimization, Springer, vol. 39(3), pages 874-898, April.
- Jose Apesteguia & Miguel A. Ballester, 2015.
"A Measure of Rationality and Welfare,"
Journal of Political Economy, University of Chicago Press, vol. 123(6), pages 1278-1310.
- Jose Apesteguia & Miguel Angel Ballester, 2010. "A measure of rationality and welfare," Economics Working Papers 1220, Department of Economics and Business, Universitat Pompeu Fabra, revised Oct 2014.
- Jose Apesteguia & Miguel Ángel Ballester, 2014. "A Measure of Rationality and Welfare," Working Papers 573, Barcelona School of Economics.
- Jose Apesteguia & Miguel Ángel Ballester, 2010. "A Measure of Rationality and Welfare," Working Papers 467, Barcelona School of Economics.
- Jamie Fairbrother & Adam N. Letchford & Keith Briggs, 2018. "A two-level graph partitioning problem arising in mobile wireless communications," Computational Optimization and Applications, Springer, vol. 69(3), pages 653-676, April.
- Miles William W & Fowks Gary T & Coulter Lisa O, 2010. "AccuV College Football Ranking Model," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 6(3), pages 1-17, July.
- Dupont, Audrey & Linhares, Andréa Carneiro & Artigues, Christian & Feillet, Dominique & Michelon, Philippe & Vasquez, Michel, 2009. "The dynamic frequency assignment problem," European Journal of Operational Research, Elsevier, vol. 195(1), pages 75-88, May.
- Akbari, Sina & Escobedo, Adolfo R., 2023. "Beyond kemeny rank aggregation: A parameterizable-penalty framework for robust ranking aggregation with ties," Omega, Elsevier, vol. 119(C).
- Dennis S. Holm & Rasmus Ø. Mikkelsen & Matias Sørensen & Thomas J. R. Stidsen, 2022. "A graph-based MIP formulation of the International Timetabling Competition 2019," Journal of Scheduling, Springer, vol. 25(4), pages 405-428, August.
- Manfred Padberg, 2005. "Classical Cuts for Mixed-Integer Programming and Branch-and-Cut," Annals of Operations Research, Springer, vol. 139(1), pages 321-352, October.
- Aardal, K. & van Hoesel, C.P.M., 1995. "Polyhedral techniques in combinatorial optimization," Research Memorandum 014, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Bradley Hardy & Rhyd Lewis & Jonathan Thompson, 2018. "Tackling the edge dynamic graph colouring problem with and without future adjacency information," Journal of Heuristics, Springer, vol. 24(3), pages 321-343, June.
- Hawa, Asyl L. & Lewis, Rhyd & Thompson, Jonathan M., 2022. "Exact and approximate methods for the score-constrained packing problem," European Journal of Operational Research, Elsevier, vol. 302(3), pages 847-859.
- P. Detti & D. Pacciarelli, 2001. "A branch and bound algorithm for the minimum storage‐time sequencing problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(4), pages 313-331, June.
- B. Jay Coleman, 2005. "Minimizing Game Score Violations in College Football Rankings," Interfaces, INFORMS, vol. 35(6), pages 483-496, December.
- Dietzenbacher, Erik & Yan, Bingqian, 2024. "Explaining the direction of emissions embodied in trade from hypotheses based on country rankings11Funding information: Bingqian Yan received financial support from the National Natural Science Founda," Energy Economics, Elsevier, vol. 129(C).
- Stefano Gualandi & Federico Malucelli, 2012. "Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 81-100, February.
- Elena Fernández & Justo Puerto & Antonio Rodríguez-Chía, 2013. "On discrete optimization with ordering," Annals of Operations Research, Springer, vol. 207(1), pages 83-96, August.
- Vicente Campos & Manuel Laguna & Rafael Martí, 2005. "Context-Independent Scatter and Tabu Search for Permutation Problems," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 111-122, February.
- Mutsunori Banbara & Katsumi Inoue & Benjamin Kaufmann & Tenda Okimoto & Torsten Schaub & Takehide Soh & Naoyuki Tamura & Philipp Wanko, 2019. "$${\varvec{teaspoon}}$$ teaspoon : solving the curriculum-based course timetabling problems with answer set programming," Annals of Operations Research, Springer, vol. 275(1), pages 3-37, April.
- Rajeev Kohli & Khaled Boughanmi & Vikram Kohli, 2019. "Randomized Algorithms for Lexicographic Inference," Operations Research, INFORMS, vol. 67(2), pages 357-375, March.
More about this item
Keywords
Total labeling; Edge coloring; Graph coloring; Branch-and-Cut;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:286:y:2020:i:1:d:10.1007_s10479-018-2977-x. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.