Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
From MaRDI portal
Publication:2950521
DOI10.1007/978-3-540-78295-7_5zbMath1416.90022OpenAlexW1888973625MaRDI QIDQ2950521
Irina Dumitrescu, Thomas Stützle, Marco Chiarandini
Publication date: 9 October 2015
Published in: Hybrid Metaheuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78295-7_5
Large-scale problems in mathematical programming (90C06) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)
Related Items
Matheuristics: survey and synthesis, Large neighbourhood search algorithms for the founder sequence reconstruction problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using tabu search techniques for graph coloring
- A survey of very large-scale neighborhood search techniques
- An introduction to timetabling
- \(T\)-colorings of graphs: recent results and open problems
- Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour
- A variable neighborhood search for graph coloring.
- Local branching
- An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
- Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation
- Greedy and local search heuristics for unconstrained binary quadratic programming
- Tabu search with simple ejection chains for coloring graphs
- Graph coloring for air traffic flow management
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Genetic and hybrid algorithms for graph coloring
- Hybrid evolutionary algorithms for graph coloring
- On edge orienting methods for graph coloring
- Two very large-scale neighborhoods for single machine scheduling
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
- An Ejection Chain Approach for the Generalized Assignment Problem
- A Large Neighborhood Search Heuristic for Graph Coloring
- A graph coloring algorithm for large scheduling problems
- An Efficient Heuristic Procedure for Partitioning Graphs
- New methods to color the vertices of a graph
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
