scientific article

From MaRDI portal
Revision as of 03:15, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4038710

zbMath0766.90079MaRDI QIDQ4038710

David S. Johnson

Publication date: 18 May 1993


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (62)

ParadisEO-MO: from fitness landscape analysis to efficient local search algorithmsA user's guide to tabu searchMetastrategy simulated annealing and tabu search algorithms for the vehicle routing problemEmbedded local search approaches for routing optimizationSimulated annealing and tabu search: Lessons from a line searchA new adaptive multi-start technique for combinatorial global optimizationsEvolution based learning in a job shop scheduling environmentGlobal strategies for augmenting the efficiency of TSP heuristicsTSP race: minimizing completion time in time-sensitive applicationsMetaheuristics for the single machine weighted quadratic tardiness scheduling problemAn efficient evolutionary algorithm for the orienteering problemTSP ejection chainsRouting problems: A bibliographyStrategies with memories: Local search in an application oriented environment. Applied local search -- a prologueThe approximation ratio of the 2-Opt heuristic for the metric traveling salesman problemDivide and conquer strategies for parallel TSP heuristicsCombining simulated annealing with local search heuristicsDesigning and reporting on computational experiments with heuristic methodsParallel local searchJob-shop scheduling: Computational study of local search and large-step optimization methodsA new extension of local search applied to the Dial-A-Ride problemEpsilon-transformation: exploiting phase transitions to solve combinatorial optimization problemsTruly tight bounds for TSP heuristicsMPILS: an automatic tuner for MILP solversAutomated slideshow design from a set of photos based on a hybrid Metaheuristic approachUnnamed ItemOn the classification of NP-complete problems in terms of their correlation coefficientSeeking global edges for traveling salesman problem in multi-start searchAn efficient local search for the feedback vertex set problemA survey on optimization metaheuristicsAn iterated local search algorithm for the vehicle routing problem with convex time penalty functionsNeural networks for NP-complete problemsThe traveling salesman problem: An overview of exact and approximate algorithmsLarge-step Markov chains for the TSP incorporating local search heuristicsOn the solving strategy in composite heuristicsA modified Lin--Kernighan traveling-salesman heuristicEfficient branch-and-bound algorithms for weighted MAX-2-SATImproved local search algorithms for the rectangle packing problem with general spatial costsDynamics of local search trajectory in traveling salesman problemOn the landscape ruggedness of the quadratic assignment problemA note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problemProvably good solutions for the traveling salesman problemExperiments on the minimum linear arrangement problemDistances between traveling salesman toursGuided local search and its application to the traveling salesman problemA gene-pool based genetic algorithm for TSPGenetic algorithms and traveling salesman problemsUsing tornado-related weather data to route unmanned aerial vehicles to locate damage and victimsNature's way of optimizingAn effective local search for the maximum clique problemEstimating the Held-Karp lower bound for the geometric TSPNew edges not used in shortest tours of TSPGeneral \(k\)-opt submoves for the Lin-Kernighan TSP heuristicAn effective implementation of the Lin-Kernighan traveling salesman heuristicAdaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman ProblemApplication of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanismMinimizing flow time variance in a single machine system using genetic algorithmsA hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problemGenetic local search in combinatorial optimizationBest-so-far vs. where-you-are: Implications for optimal finite-time annealingOne-dimensional cutting stock problem to minimize the number of different patternsA fuzzy genetic algorithm for driver scheduling







This page was built for publication: