Pages that link to "Item:Q1917273"

The following pages link to Ejection chains, reference structures and alternating path methods for traveling salesman problems (Q1917273):

Displaying 50 items.

• Modelization of time-dependent urban freight problems by using a multiple number of distribution centers (Q262919) (← links)
• Repairing high school timetables with polymorphic ejection chains (Q284402) (← links)
• Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem (Q306092) (← links)
• On service consistency in multi-period vehicle routing (Q319190) (← links)
• Network-flow based algorithms for scheduling production in multi-processor open-pit mines accounting for metal uncertainty (Q322445) (← links)
• A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem (Q323161) (← links)
• An ejection chain approach for the quadratic multiple knapsack problem (Q323171) (← links)
• Traveling salesman problem heuristics: leading methods, implementations and latest advances (Q418054) (← links)
• Constraint-based very large-scale neighborhood search (Q434452) (← links)
• Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints (Q443822) (← links)
• Timetable construction: the algorithms and complexity perspective (Q475200) (← links)
• Valuated matroid-based algorithm for submodular welfare problem (Q492835) (← links)
• The balanced academic curriculum problem revisited (Q519088) (← links)
• A filter-and-fan approach to the 2D HP model of the protein folding problem (Q646723) (← links)
• A survey of very large-scale neighborhood search techniques (Q697563) (← links)
• A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources (Q716354) (← links)
• Metaheuristics in combinatorial optimization (Q817206) (← links)
• Classification of applied methods of combinatorial optimization (Q844352) (← links)
• Heuristics for the mirrored traveling tournament problem (Q863992) (← links)
• Using tabu search for solving a dynamic multi-terminal truck dispatching problem (Q1388833) (← links)
• Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number (Q1602705) (← links)
• Domination analysis of some heuristics for the traveling salesman problem (Q1602706) (← links)
• Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration (Q1634051) (← links)
• Stochastic local search with learning automaton for the swap-body vehicle routing problem (Q1652446) (← links)
• Order matters -- a variable neighborhood search for the swap-body vehicle routing problem (Q1694919) (← links)
• General variable neighborhood search for the order batching and sequencing problem (Q1695017) (← links)
• Knowledge-guided local search for the vehicle routing problem (Q1722960) (← links)
• What makes a VRP solution good? The generation of problem-specific knowledge for heuristics (Q1734855) (← links)
• Efficiently solving very large-scale routing problems (Q1738815) (← links)
• A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs (Q1806891) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• Quantum bridge analytics II: QUBO-plus, network optimization and combinatorial chaining for asset exchange (Q2026705) (← links)
• A hybrid heuristic for the maximum dispersion problem (Q2028755) (← links)
• A comparative analysis of two matheuristics by means of merged local optima networks (Q2029302) (← links)
• Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange (Q2159525) (← links)
• A survey on the applications of variable neighborhood search algorithm in healthcare management (Q2240705) (← links)
• A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem (Q2248551) (← links)
• A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP (Q2307980) (← links)
• Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas (Q2315629) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem (Q2386217) (← links)
• Employee workload balancing by graph partitioning (Q2448894) (← links)
• An improved simulated annealing algorithm for bandwidth minimization (Q2464218) (← links)
• Sequential search and its application to vehicle-routing problems (Q2489298) (← links)
• A simple filter-and-fan approach to the facility location problem (Q2489306) (← links)
• Creating very large scale neighborhoods out of smaller ones by compounding moves (Q2491337) (← links)
• An iterated local search algorithm for the vehicle routing problem with backhauls (Q2514876) (← links)
• A path relinking approach with ejection chains for the generalized assignment problem (Q2570155) (← links)
• A note on single alternating cycle neighborhoods for the TSP (Q2573008) (← links)
• Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)