scientific article; zbMATH DE number 3895002
From MaRDI portal
Publication:5187226
zbMath0562.00014MaRDI QIDQ5187226
No author found.
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Conference proceedings and collections of articles (00Bxx)
Related Items (only showing first 100 items - show all)
An introduction to parallelism in combinatorial optimization ⋮ Linearizable special cases of the QAP ⋮ A parallel tabu search algorithm for large traveling salesman problems ⋮ Nearest-neighbour heuristics in accelerated algorithms of optimisation problems ⋮ The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem ⋮ MP or not MP: that is the question ⋮ The multiple traveling salesman problem on spiders ⋮ Robust optimization for routing problems on trees ⋮ Online \(k\)-server routing problems ⋮ Network design with edge-connectivity and degree constraints ⋮ Solving the traveling repairman problem on a line with general processing times and deadlines ⋮ On the recoverable robust traveling salesman problem ⋮ Computing the maximum violation of a Bell inequality is an NP-problem ⋮ Ordered spatial sampling by means of the traveling salesman problem ⋮ On common edges in optimal solutions to traveling salesman and other optimization problems ⋮ A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem ⋮ Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices ⋮ A (0-1) goal programming model for scheduling the tour of a marketing executive ⋮ Load-dependent and precedence-based models for pickup and delivery problems ⋮ Continuous reductions among combinatorial optimization problems ⋮ A new asymmetric pyramidally solvable class of the traveling salesman problem ⋮ Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation ⋮ Bound sets for biobjective combinatorial optimization problems ⋮ The dragon war ⋮ Controlled mobility in stochastic and dynamic wireless networks ⋮ A stochastic and dynamic model for the single-vehicle pick-up and delivery problem ⋮ Submodularity and the traveling salesman problem ⋮ A simple LP relaxation for the asymmetric traveling salesman problem ⋮ The parameterized complexity of local search for TSP, more refined ⋮ Sequencing and scheduling in robotic cells: recent developments ⋮ An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem ⋮ Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem ⋮ Traveling salesman problem with clustering ⋮ Maximum travelling salesman problem. I ⋮ Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs ⋮ The multiple traveling salesmen problem with moving targets ⋮ Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times ⋮ Analyzing the Held-Karp TSP bound: A monotonicity property with application ⋮ On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space ⋮ The \((n^ 2-1)\)-puzzle and related relocation problems ⋮ An efficient implementation of local search algorithms for constrained routing problems ⋮ Synchronized routing of seasonal products through a production/distribution network ⋮ A note on exploiting the Hamiltonian cycle problem substructure of the asymmetric traveling salesman problem ⋮ A note on the traveling salesman reoptimization problem under vertex insertion ⋮ The on-line asymmetric traveling salesman problem ⋮ Sequencing situations with just-in-time arrival, and related games ⋮ The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities ⋮ An additive bounding procedure for the asymmetric travelling salesman problem ⋮ Traveling salesman games ⋮ Probabilistic analysis of an approximation algorithm for the \(m\)-peripatetic salesman problem on random instances unbounded from above ⋮ A note on the effect of neighborhood structure in simulated annealing ⋮ The travelling salesman problem and adiabatic quantum computation: an algorithm ⋮ How to find Steiner minimal trees in Euclidean \(d\)-space ⋮ Natural and extended formulations for the time-dependent traveling salesman problem ⋮ Approximate algorithms for the traveling salesman problem. II ⋮ A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs ⋮ Golden ratio versus pi as random sequence sources for Monte Carlo integration ⋮ Using immune-based genetic algorithms for single trader's periodic marketing problem ⋮ Combined route capacity and route length models for unit demand vehicle routing problems ⋮ The traveling salesman problem: An overview of exact and approximate algorithms ⋮ A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems ⋮ Exact methods for solving the elementary shortest and longest path problems ⋮ A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem ⋮ The stochastic vehicle routing problem revisited ⋮ Experimental analysis of heuristics for the bottleneck traveling salesman problem ⋮ Quick updates for \(p\)-opt TSP heuristics ⋮ Traveling salesman problem under categorization ⋮ On the solving strategy in composite heuristics ⋮ Polyhedral study of the capacitated vehicle routing problem ⋮ Survivable networks, linear programming relaxations and the parsimonious property ⋮ On the complexity of generating synchronizable test sequences ⋮ Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching ⋮ A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery ⋮ Consecutive block minimization is 1.5-approximable ⋮ Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) ⋮ Optimal search path for service in the presence of disruptions ⋮ An efficient procedure for the N-city traveling salesman problem ⋮ Randomized gravitational emulation search algorithm for symmetric traveling salesman problem ⋮ The indefinite period traveling salesman problem ⋮ Global versus local search: the impact of population sizes on evolutionary algorithm performance ⋮ Model-based view planning ⋮ Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem ⋮ The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem ⋮ Algebraic languages for mathematical programming ⋮ Approximation algorithms for multi-criteria traveling salesman problems ⋮ A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem ⋮ An improved annealing scheme for the QAP ⋮ A genetic algorithm for service level based vehicle scheduling ⋮ Vehicle routing problem with trailers ⋮ The use of dynamic programming in genetic algorithms for permutation problems ⋮ Stability aspects of the traveling salesman problem based on \(k\)-best solutions ⋮ A stochastic and dynamic routing policy using branching processes with state dependent immigration ⋮ Minimum directed 1-subtree relaxation for score orienteering problem ⋮ General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic ⋮ Reoptimization of minimum and maximum traveling salesman's tours ⋮ A class of exponential neighbourhoods for the quadratic travelling salesman problem ⋮ Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism ⋮ A cutting-plane approach to the edge-weighted maximal clique problem ⋮ A novel machine grouping and knowledge-based approach for cellular manufacturing ⋮ Best-so-far vs. where-you-are: Implications for optimal finite-time annealing
This page was built for publication:
