IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v13y2007i2d10.1007_s10878-006-9019-3.html
   My bibliography  Save this article

On edge orienting methods for graph coloring

Author

Listed:
  • Bernard Gendron

    (Université de Montréal)

  • Alain Hertz

    (École Polytechnique)

  • Patrick St-Louis

    (Université de Montréal)

Abstract

We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge orienting problem is equivalent to finding the chromatic number of a graph. We study various properties of edge orienting methods in the context of local search for graph coloring. We then exploit these properties to derive four tabu search algorithms, each based on a different neighborhood. We compare these algorithms numerically to determine which are the most promising and to give potential research directions.

Suggested Citation

  • Bernard Gendron & Alain Hertz & Patrick St-Louis, 2007. "On edge orienting methods for graph coloring," Journal of Combinatorial Optimization, Springer, vol. 13(2), pages 163-178, February.
  • Handle: RePEc:spr:jcomop:v:13:y:2007:i:2:d:10.1007_s10878-006-9019-3
    DOI: 10.1007/s10878-006-9019-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-006-9019-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-006-9019-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Valmir C. Barbosa & Carlos A.G. Assis & Josina O. Do Nascimento, 2004. "Two Novel Evolutionary Formulations of the Graph Coloring Problem," Journal of Combinatorial Optimization, Springer, vol. 8(1), pages 41-63, March.
    2. Peter J. M. van Laarhoven & Emile H. L. Aarts & Jan Karel Lenstra, 1992. "Job Shop Scheduling by Simulated Annealing," Operations Research, INFORMS, vol. 40(1), pages 113-125, February.
    3. Anuj Mehrotra & Michael A. Trick, 1996. "A Column Generation Approach for Graph Coloring," INFORMS Journal on Computing, INFORMS, vol. 8(4), pages 344-354, November.
    4. J. Randall Brown, 1972. "Chromatic Scheduling and the Chromatic Number Problem," Management Science, INFORMS, vol. 19(4-Part-1), pages 456-463, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Peter Damaschke, 2019. "Parameterized Mixed Graph Coloring," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 362-374, August.

    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.
    1. Xiao-Feng Xie & Jiming Liu, 2009. "Graph coloring by multiagent fusion search," Journal of Combinatorial Optimization, Springer, vol. 18(2), pages 99-123, August.
    2. Massimiliano Caramia & Paolo Dell'Olmo, 2001. "Iterative coloring extension of a maximum clique," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(6), pages 518-550, September.
    3. Syam Menon & Rakesh Gupta, 2008. "Optimal Broadcast Scheduling in Packet Radio Networks via Branch and Price," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 391-399, August.
    4. Muñoz, Susana & Teresa Ortuño, M. & Ramírez, Javier & Yáñez, Javier, 2005. "Coloring fuzzy graphs," Omega, Elsevier, vol. 33(3), pages 211-221, June.
    5. Caramia, Massimiliano & Dell'Olmo, Paolo, 2008. "Embedding a novel objective function in a two-phased local search for robust vertex coloring," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1358-1380, September.
    6. Severino F. Galán, 2017. "Simple decentralized graph coloring," Computational Optimization and Applications, Springer, vol. 66(1), pages 163-185, January.
    7. Alex Gliesch & Marcus Ritt, 2022. "A new heuristic for finding verifiable k-vertex-critical subgraphs," Journal of Heuristics, Springer, vol. 28(1), pages 61-91, February.
    8. Jianjun Jiao & Lansun Chen, 2007. "Global Attractivity And Permanence Of A Stage-Structured Pest Managementsimodel With Time Delay And Diseased Pests Impulsive Transmission," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 10(04), pages 479-494.
    9. Isnaini Rosyida & Jin Peng & Lin Chen & Widodo Widodo & Ch. Rini Indrati & Kiki A. Sugeng, 2018. "An uncertain chromatic number of an uncertain graph based on $$\alpha $$ α -cut coloring," Fuzzy Optimization and Decision Making, Springer, vol. 17(1), pages 103-123, March.
    10. N. Cherfi & M. Hifi, 2010. "A column generation method for the multiple-choice multi-dimensional knapsack problem," Computational Optimization and Applications, Springer, vol. 46(1), pages 51-73, May.
    11. Bürgy, Reinhard & Bülbül, Kerem, 2018. "The job shop scheduling problem with convex costs," European Journal of Operational Research, Elsevier, vol. 268(1), pages 82-100.
    12. M Plumettaz & D Schindl & N Zufferey, 2010. "Ant Local Search and its efficient adaptation to graph colouring," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(5), pages 819-826, May.
    13. Benjamin McClosky & John D. Arellano & Illya V. Hicks, 2015. "Co-2-plex vertex partitions," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 729-746, October.
    14. Irene Samora & Mário Franca & Anton Schleiss & Helena Ramos, 2016. "Simulated Annealing in Optimization of Energy Production in a Water Supply Network," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 30(4), pages 1533-1547, March.
    15. 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.
    16. Sudhendu Rai & Charles B. Duke & Vaughn Lowe & Cyndi Quan-Trotter & Thomas Scheermesser, 2009. "LDP Lean Document Production---O.R.-Enhanced Productivity Improvements for the Printing Industry," Interfaces, INFORMS, vol. 39(1), pages 69-90, February.
    17. Zacharie Ales & Céline Engelbeen & Rosa Figueiredo, 2024. "Correlation Clustering Problem Under Mediation," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 672-689, March.
    18. Arash Amirteimoori & Reza Kia, 2023. "Concurrent scheduling of jobs and AGVs in a flexible job shop system: a parallel hybrid PSO-GA meta-heuristic," Flexible Services and Manufacturing Journal, Springer, vol. 35(3), pages 727-753, September.
    19. D Briskorn & A Drexl, 2009. "A branch-and-price algorithm for scheduling sport leagues," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 84-93, January.
    20. Claudio Gambella & Joe Naoum-Sawaya & Bissan Ghaddar, 2018. "The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 554-569, August.

    Corrections

    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:jcomop:v:13:y:2007:i:2:d:10.1007_s10878-006-9019-3. 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.