Ejection chain and filter-and-fan methods in combinatorial optimization
From MaRDI portal
Publication:5900890
DOI10.1007/S10479-009-0656-7zbMath1185.90177OpenAlexW2020008181MaRDI QIDQ5900890
Publication date: 10 May 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.302.4187
Related Items (5)
Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ Dual-neighborhood iterated local search for routing and wavelength assignment ⋮ Traveling salesman problem heuristics: leading methods, implementations and latest advances ⋮ Variable neighborhood search: basics and variants ⋮ Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A filter-and-fan approach to the 2D HP model of the protein folding problem
- A data structure useful for finding Hamiltonian cycles
- A filter-and-fan approach to the job shop scheduling problem
- Topological design of telecommunication networks --- local access design methods
- Uncapacitated facility location: General solution procedure and computational experience
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Relaxed tours and path ejections for the traveling salesman problem
- Job shop scheduling with beam search
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
- Data structures and ejection chains for solving large-scale traveling salesman problems
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Probabilistic diversification and intensification in local search for vehicle routing
- A hybrid genetic algorithm for the job shop scheduling problem
- A simple filter-and-fan approach to the facility location problem
- A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
- A note on single alternating cycle neighborhoods for the TSP
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- A Subpath Ejection Method for the Vehicle Routing Problem
- Chained Lin-Kernighan for Large Traveling Salesman Problems
- An Ejection Chain Approach for the Generalized Assignment Problem
- Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem
- An ejection chain algorithm for the quadratic assignment problem
- Subgraph ejection chains and tabu search for the crew scheduling problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Local Search for the Asymmetric Traveling Salesman Problem
- Topological design of centralized computer networks—formulations and algorithms
- Parallel iterative search methods for vehicle routing problems
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- Fast Clustering Algorithms
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
- Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Data Structures for Traveling Salesmen
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Ejection chain and filter-and-fan methods in combinatorial optimization
- Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
This page was built for publication: Ejection chain and filter-and-fan methods in combinatorial optimization
