Pages that link to "Item:Q3981972"
From MaRDI portal
The following pages link to Large-step Markov chains for the traveling salesman problem (Q3981972):
Displaying 44 items.
- A hybrid clonal selection algorithm for the location routing problem with stochastic demands (Q276534) (← links)
- Lower and upper bounds for the bin packing problem with fragile objects (Q406499) (← links)
- Traveling salesman problem heuristics: leading methods, implementations and latest advances (Q418054) (← links)
- Using Markov chains to analyze the effectiveness of local search algorithms (Q429676) (← links)
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem (Q443828) (← links)
- A survey on optimization metaheuristics (Q497180) (← links)
- A discrete gravitational search algorithm for solving combinatorial optimization problems (Q498096) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- Heuristics for the mirrored traveling tournament problem (Q863992) (← links)
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion (Q959513) (← links)
- Probabilistic exchange algorithms and Euclidean traveling salesman problems (Q1079126) (← links)
- Large-step Markov chains for the TSP incorporating local search heuristics (Q1197908) (← links)
- A local search template. (Q1406708) (← links)
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size (Q1596947) (← links)
- Alternative evaluation functions for the cyclic bandwidth sum problem (Q1631512) (← links)
- The impact of solution representations on heuristic net present value optimization in discrete time/cost trade-off project scheduling with multiple cash flow and payment models (Q1634073) (← links)
- Metaheuristics for the single machine weighted quadratic tardiness scheduling problem (Q1651631) (← links)
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem (Q1652142) (← links)
- Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times (Q1652166) (← links)
- A new adaptive Hungarian mating scheme in genetic algorithms (Q1726046) (← links)
- Job shop scheduling with beam search (Q1806850) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- Case injected genetic algorithms for traveling salesman problems (Q1854036) (← links)
- Embedded local search approaches for routing optimization (Q1886851) (← links)
- Combining simulated annealing with local search heuristics (Q1919834) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Parallel local search (Q1922627) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem (Q2028800) (← links)
- A metaheuristic for the delivery man problem with time windows (Q2045024) (← links)
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms (Q2359156) (← links)
- Iterated local search for the quadratic assignment problem (Q2503224) (← links)
- Improved large-step Markov chain variants for the symmetric TSP (Q2567843) (← links)
- Iterated local search algorithms for the Euclidean Steiner tree problem in \(n\) dimensions (Q2829166) (← links)
- Chained Lin-Kernighan for large traveling salesman problems (Q2884550) (← links)
- Hybrid Metaheuristics: An Introduction (Q2950517) (← links)
- An iterative local search approach applied to the optimal stratification problem (Q3002556) (← links)
- (Q3976687) (← links)
- On the Foundations and the Applications of Evolutionary Computing (Q4649201) (← links)
- Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP (Q5458509) (← links)
- Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining (Q6070880) (← links)
- Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates (Q6554640) (← links)
