Publication:5187226
From MaRDI portal
zbMath0562.00014MaRDI QIDQ5187226
No author found.
Publication date: 1985
90-06: Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming
00Bxx: Conference proceedings and collections of articles
Related Items
An efficient procedure for the N-city traveling salesman problem, Polyhedral study of the capacitated vehicle routing problem, Survivable networks, linear programming relaxations and the parsimonious property, A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery, Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s), An improved annealing scheme for the QAP, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, A (0-1) goal programming model for scheduling the tour of a marketing executive, A new asymmetric pyramidally solvable class of the traveling salesman problem, Bound sets for biobjective combinatorial optimization problems, The dragon war, Sequencing and scheduling in robotic cells: recent developments, Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem, Analyzing the Held-Karp TSP bound: A monotonicity property with application, 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, The on-line asymmetric traveling salesman problem, 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, A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem, Model-based view planning, An introduction to parallelism in combinatorial optimization, On common edges in optimal solutions to traveling salesman and other optimization problems, Continuous reductions among combinatorial optimization problems, Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation, A stochastic and dynamic model for the single-vehicle pick-up and delivery problem, Submodularity and the traveling salesman problem, A note on exploiting the Hamiltonian cycle problem substructure of the asymmetric traveling salesman problem, 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, A note on the effect of neighborhood structure in simulated annealing, How to find Steiner minimal trees in Euclidean \(d\)-space, The traveling salesman problem: An overview of exact and approximate algorithms, A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems, The stochastic vehicle routing problem revisited, Quick updates for \(p\)-opt TSP heuristics, Traveling salesman problem under categorization, On the solving strategy in composite heuristics, On the complexity of generating synchronizable test sequences, The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem, Algebraic languages for mathematical programming, A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem, 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, 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, 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, Genetically improved presequences for Euclidean traveling salesman problems, A new adaptive multi-start technique for combinatorial global optimizations, A new exact algorithm for the solution of quadratic assignment problems, Expected part delays as a secondary layout criterion in automated manufacturing systems, A bound for the symmetric travelling salesman problem through matroid formulation, The Euclidean traveling salesman problem and a space-filling curve, Transformations of generalized ATSP into ATSP., 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times., Genetic local search with distance preserving recombination operator for a vehicle routing problem., On Gilmore-Gomory's open question for the bottleneck TSP., Modelling and solving central cycle problems with integer programming., On the nearest neighbor rule for the traveling salesman problem, The asymmetric traveling salesman problem with replenishment arcs, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, A hitchhiker's guide to the techniques of adaptive nonlinear models, An effective implementation of the Lin-Kernighan traveling salesman heuristic, An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices, New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization, The period traveling salesman problem: A new heuristic algorithm, Arranging program statements for locality on the basis of neighbourhood preferences, Relaxed tours and path ejections for the traveling salesman problem, Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion, Complexity of the directed spanning cactus problem, Sequential and parallel local search for the time-constrained traveling salesman problem, The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints, Routing heuristics for automated pick and place machines, Guided local search and its application to the traveling salesman problem, Generalized network design problems., TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer, Constrained spanning trees and the traveling salesman problem, New lower bounds for the symmetric travelling salesman problem, Computational efficiency and interactive MOLP algorithms: An implementation of the SIMOLP procedure, Approximation algorithms for lawn mowing and milling, Determination of optimal path under approach and exit constraints, A combinatorial study of partial order polytopes, A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem, An improved heuristic for the period traveling salesman problem, New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints, Embedded local search approaches for routing optimization, Complexity of flow shop scheduling problems with transportation constraints, Monge matrices make maximization manageable, A new heuristic for the period traveling salesman problem, Unnamed Item, A PARALLEL BEST-FIRST B&B ALGORITHM AND ITS AXIOMATIZATION, The symmetric generalized traveling salesman polytope, AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES, Combinatorial optimization analysis of the unary NP-complete disassembly line balancing problem, Planning as heuristic search, Planning and control in artificial intelligence: A unifying perspective, The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints, A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem, On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem, Rotation cycle schedulings for multi-item production systems., Performance of linear-space search algorithms, The order of points on the second convex hull of a simple polygon, Path covering problems and testing of printed circuits, Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison, On the recognition of permuted bottleneck Monge matrices, On properties of geometric random problems in the plane, Genetic algorithms for the traveling salesman problem, Designing and reporting on computational experiments with heuristic methods, Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes, Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches, The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges, Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints, The searching over separators strategy to solve some NP-hard problems in subexponential time, An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search, Topological design of a two-level network with ring-star configuration, Further results on the probabilistic traveling salesman problem, Replenishment routing problems between a single supplier and multiple retailers with direct delivery, Discrete optimization by optimal control methods. II: The static traveling salesman problem, On polyhedra induced by point sets in space, Single vehicle routing with a predefined customer sequence and multiple depot returns, Formulations and exact algorithms for the vehicle routing problem with time windows, Traveling salesman path problems, The linear ordering problem with cumulative costs, Determination of the candidate arc set for the asymmetric traveling salesman problem, Expanding neighborhood GRASP for the traveling salesman problem, An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints, Toughness in graphs -- a survey, On pedigree polytopes and Hamiltonian cycles, Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups, A note on single alternating cycle neighborhoods for the TSP, Fast local search algorithms for the handicapped persons transportation problem, Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices, A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem, The traveling salesman problem with few inner points, Special cases of travelling salesman problems and heuristics, Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems, SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS, Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck, Automatic production planning of press brakes for sheet metal bending, A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem, Locating a cycle in a transportation or a telecommunications network, Polyhedral Combinatorics in Combinatorial Optimization, The prize collecting traveling salesman problem, Unnamed Item, On finding a cyclic tour and a vehicle loading plan yielding maximum profit
