scientific article
From MaRDI portal
Publication:3981972
zbMath0736.90063MaRDI QIDQ3981972
Edward W. Felten, Olivier C. Martin, Steve W. Otto
Publication date: 26 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms ⋮ A hybrid clonal selection algorithm for the location routing problem with stochastic demands ⋮ Embedded local search approaches for routing optimization ⋮ Alternative evaluation functions for the cyclic bandwidth sum problem ⋮ 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 ⋮ A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem ⋮ Metaheuristics for the single machine weighted quadratic tardiness scheduling problem ⋮ A heuristic algorithm for a single vehicle static bike sharing rebalancing problem ⋮ Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times ⋮ Heuristics for the mirrored traveling tournament problem ⋮ Combining simulated annealing with local search heuristics ⋮ Metaheuristics: A bibliography ⋮ Parallel local search ⋮ A simple and effective metaheuristic for the minimum latency problem ⋮ Hybrid Metaheuristics: An Introduction ⋮ Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining ⋮ Lower and upper bounds for the bin packing problem with fragile objects ⋮ Traveling salesman problem heuristics: leading methods, implementations and latest advances ⋮ A local search template. ⋮ Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times ⋮ An implementation of the iterated tabu search algorithm for the quadratic assignment problem ⋮ A new adaptive Hungarian mating scheme in genetic algorithms ⋮ An iterative local search approach applied to the optimal stratification problem ⋮ A survey on optimization metaheuristics ⋮ A discrete gravitational search algorithm for solving combinatorial optimization problems ⋮ On the Foundations and the Applications of Evolutionary Computing ⋮ Large-step Markov chains for the TSP incorporating local search heuristics ⋮ An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion ⋮ Efficient branch-and-bound algorithms for weighted MAX-2-SAT ⋮ Iterated local search for the quadratic assignment problem ⋮ Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem ⋮ Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP ⋮ A metaheuristic for the delivery man problem with time windows ⋮ Job shop scheduling with beam search ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ Iterated local search algorithms for the Euclidean Steiner tree problem inndimensions ⋮ Case injected genetic algorithms for traveling salesman problems ⋮ A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
