A variable neighborhood search for graph coloring.
From MaRDI portal
Publication:1410622
DOI10.1016/S0377-2217(02)00832-9zbMath1053.90050OpenAlexW1971493157MaRDI QIDQ1410622
Cédric Avanthay, Nicolas Zufferey, Alain Hertz
Publication date: 14 October 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00832-9
Related Items
Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines, A variable neighbourhood search algorithm for the flexible job-shop scheduling problem, Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm, Solving the unconstrained optimization problem by a variable neighborhood search, Simple decentralized graph coloring, Iterated local search with tabu search for the weighted vertex coloring problem, Algorithms for the maximum \(k\)-club problem in graphs, Grouping products for the optimization of production processes: a case in the steel manufacturing industry, Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems, An ant colony optimisation algorithm for scheduling in agile manufacturing, A graph coloring heuristic using partial solutions and a reactive tabu scheme, A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem, A survey on vertex coloring problems, A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic, A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation, An improved ant colony optimisation heuristic for graph colouring, Variable space search for graph coloring, Hybrid evolutionary algorithm for the b-chromatic number, A wide-ranging computational comparison of high-performance graph colouring algorithms, Coloring large graphs based on independent set extraction, Variable neighbourhood search: methods and applications, Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm, A survey of local search methods for graph coloring, An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring, Improving the extraction and expansion method for large graph coloring, A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application, Minimizing total tardiness on a single machine with controllable processing times, A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing, Combinatorial optimization in system configuration design, Corrigendum to ``Variable space search for graph coloring [Discrete Appl. Math. 156, No.\,13, 2551--2560 (2008; Zbl 1213.05085)], Variable neighbourhood search: Methods and applications, Heuristics for determining the number of warehouses for storing non-compatible products, A search space ``cartography for guiding graph coloring heuristics, On a parallel genetic-tabu search based algorithm for solving the graph colouring problem, A memetic algorithm for graph coloring, A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments, INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING, AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Using tabu search techniques for graph coloring
- Some experiments with simulated annealing for coloring graphs
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- A new adaptive multi-start technique for combinatorial global optimizations
- Variable neighborhood search
- Greedy randomized adaptive search procedures
- Genetic and hybrid algorithms for graph coloring
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
- Hybrid evolutionary algorithms for graph coloring
- Solving the maximum clique problem using a tabu search approach
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Tabu Search—Part I
- Tabu Search—Part II
- New methods to color the vertices of a graph
- Chromatic Scheduling and the Chromatic Number Problem
