scientific article
From MaRDI portal
Publication:4038710
zbMath0766.90079MaRDI QIDQ4038710
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms, A user's guide to tabu search, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Embedded local search approaches for routing optimization, Simulated annealing and tabu search: Lessons from a line search, A new adaptive multi-start technique for combinatorial global optimizations, Evolution based learning in a job shop scheduling environment, Global strategies for augmenting the efficiency of TSP heuristics, TSP race: minimizing completion time in time-sensitive applications, Metaheuristics for the single machine weighted quadratic tardiness scheduling problem, An efficient evolutionary algorithm for the orienteering problem, TSP ejection chains, Routing problems: A bibliography, Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue, The approximation ratio of the 2-Opt heuristic for the metric traveling salesman problem, Divide and conquer strategies for parallel TSP heuristics, Combining simulated annealing with local search heuristics, Designing and reporting on computational experiments with heuristic methods, Parallel local search, Job-shop scheduling: Computational study of local search and large-step optimization methods, A new extension of local search applied to the Dial-A-Ride problem, Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems, Truly tight bounds for TSP heuristics, MPILS: an automatic tuner for MILP solvers, Automated slideshow design from a set of photos based on a hybrid Metaheuristic approach, Unnamed Item, On the classification of NP-complete problems in terms of their correlation coefficient, Seeking global edges for traveling salesman problem in multi-start search, An efficient local search for the feedback vertex set problem, A survey on optimization metaheuristics, An iterated local search algorithm for the vehicle routing problem with convex time penalty functions, Neural networks for NP-complete problems, The traveling salesman problem: An overview of exact and approximate algorithms, Large-step Markov chains for the TSP incorporating local search heuristics, On the solving strategy in composite heuristics, A modified Lin--Kernighan traveling-salesman heuristic, Efficient branch-and-bound algorithms for weighted MAX-2-SAT, Improved local search algorithms for the rectangle packing problem with general spatial costs, Dynamics of local search trajectory in traveling salesman problem, On the landscape ruggedness of the quadratic assignment problem, A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem, Provably good solutions for the traveling salesman problem, Experiments on the minimum linear arrangement problem, Distances between traveling salesman tours, Guided local search and its application to the traveling salesman problem, A gene-pool based genetic algorithm for TSP, Genetic algorithms and traveling salesman problems, Using tornado-related weather data to route unmanned aerial vehicles to locate damage and victims, Nature's way of optimizing, An effective local search for the maximum clique problem, Estimating the Held-Karp lower bound for the geometric TSP, New edges not used in shortest tours of TSP, General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic, An effective implementation of the Lin-Kernighan traveling salesman heuristic, Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem, Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism, Minimizing flow time variance in a single machine system using genetic algorithms, A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem, Genetic local search in combinatorial optimization, Best-so-far vs. where-you-are: Implications for optimal finite-time annealing, One-dimensional cutting stock problem to minimize the number of different patterns, A fuzzy genetic algorithm for driver scheduling
