scientific article; zbMATH DE number 1893558
From MaRDI portal
Publication:4801179
zbMath1010.68848MaRDI QIDQ4801179
L. A. McGeoch, Jill Cirasella, Weixiong Zhang, David S. Johnson
Publication date: 7 April 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2153/21530032.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computing methodologies and applications (68U99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Embedded local search approaches for routing optimization, Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis, Discrete heat transfer search for solving travelling salesman problem, Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem, Heuristics for a cash-collection routing problem with a cluster-first route-second approach, Traveling salesman problem heuristics: leading methods, implementations and latest advances, Upper bounds on ATSP neighborhood size., Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times, Similarities between meta-heuristics algorithms and the science of life, Unnamed Item, The on-line asymmetric traveling salesman problem, Cut-and-solve: An iterative search strategy for combinatorial optimization problems, Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal, Ejection chain and filter-and-fan methods in combinatorial optimization, Ejection chain and filter-and-fan methods in combinatorial optimization, POPMUSIC for the travelling salesman problem, Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching, Lower tolerance-based branch and bound algorithms for the ATSP, Determination of the candidate arc set for the asymmetric traveling salesman problem, A review of TSP based approaches for flowshop scheduling, Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities
Uses Software
