Pages that link to "Item:Q1917273"
From MaRDI portal
The following pages link to Ejection chains, reference structures and alternating path methods for traveling salesman problems (Q1917273):
Displaying 15 items.
- Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
- Variable neighborhood search for the dial-a-ride problem (Q2655965) (← links)
- A variable depth neighborhood search algorithm for the min-max arc crossing problem (Q2669507) (← links)
- A subpath ejection method for the vehicle routing problem (Q2784052) (← links)
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems (Q2950521) (← links)
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122) (← links)
- An ejection chain algorithm for the quadratic assignment problem (Q3057181) (← links)
- Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP (Q4356654) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5899416) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5900890) (← links)
- Dual-neighborhood iterated local search for routing and wavelength assignment (Q6068726) (← links)
- VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties (Q6088244) (← links)
- A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment (Q6547137) (← links)
- Routing one million customers in a handful of minutes (Q6551178) (← links)
- Vehicle routing with time-dependent travel times: theory, practice, and benchmarks (Q6602334) (← links)
