scientific article; zbMATH DE number 795217

zbMATH Open0832.90118MaRDI QIDQ4845366FDOQ4845366

Authors: Michael Jünger, G. Rinaldi, Gerhard Reinelt 

Publication date: 5 March 1996

Title of this publication is not available (Why is that?)

Recommendations

• The traveling salesman problem: An overview of exact and approximate algorithms
• The traveling salesman problem. II: Exact methods
• scientific article; zbMATH DE number 1947373
• On the solution of traveling salesman problems
• The traveling salesman problem. I: Theoretical issues

zbMATH Keywords

traveling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Cited In (only showing first 100 items - show all)

• Models for Solving the Travelling Salesman Problem
• The traveling salesman problem: a linear programming formulation
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the power of lookahead in on-line server routing problems
• The Traveling Salesman Problem with Distances One and Two
• The traveling salesman problem with backhauls
• Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices
• On Some Generalizations of the Travelling-Salesman Problem
• Computing compatible tours for the symmetric traveling salesman problem
• New facets of the STS polytope generated from known facets of the ATS polytope
• On common edges in optimal solutions to traveling salesman and other optimization problems
• The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic
• The traveling salesman problem. Approximate algorithms
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
• Algorithms for solving the two-criterion large-scale travelling salesman problem
• The traveling salesman problem. I: Theoretical issues
• On Cutwidth Parameterized by Vertex Cover
• On the graphical relaxation of the symmetric traveling salesman polytope
• Separating clique tree and bipartition inequalities in polynomial time
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• Title not available (Why is that?)
• Title not available (Why is that?)
• Traveling salesman problem with transportation
• Title not available (Why is that?)
• AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
• The traveling salesman problem: An overview of exact and approximate algorithms
• The traveling salesman problem and its variations
• Frequency assignment in mobile radio systems using branch-and-cut techniques
• Title not available (Why is that?)
• Pyramidal traveling salesman problem
• Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
• The dragon war
• Traveling salesman problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• The selective travelling salesman problem
• The traveling salesman problem and its variations
• The on-line asymmetric traveling salesman problem
• The moving-target traveling salesman problem
• On the facial structure of symmetric and graphical traveling salesman polyhedra
• The balanced traveling salesman problem
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
• Traveling salesman problem, theory and applications.
• Title not available (Why is that?)
• Heuristic and exact algorithms for a min-max selective vehicle routing problem
• The hierarchical traveling salesman problem
• Aspects of the traveling salesman problem
• A polyhedral approach to sequence alignment problems
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• On cutwidth parameterized by vertex cover
• Traveling Salesperson Problems for the Dubins Vehicle
• Random tours in the traveling salesman problem: Analysis and application
• Traveling salesman path problems
• Travelling salesman problem tools for microcomputers
• Solving the asymmetric traveling purchaser problem
• Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching
• A concise guide to the Traveling Salesman Problem
• Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
• Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time
• Optimal arcs for the traveling salesman problem
• Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
• The traveling salesmanpProblem for lines in the plane
• Golden ratio versus pi as random sequence sources for Monte Carlo integration
• An algorithm for solving large-scale travelling-salesman problems and its numerical implementation
• Stronger \(K\)-tree relaxations for the vehicle routing problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• An alternate formulation of the symmetric traveling salesman problem and its properties
• Title not available (Why is that?)
• The traveling salesman problem. A computational study.
• Distances between traveling salesman tours
• Computing the cutwidth of bipartite permutation graphs in linear time
• The traveling salesman problem. II: Exact methods
• Optimal tour planning with specified nodes
• Combinatorial optimization and small polytopes
• An improved heuristic for the period traveling salesman problem
• The biobjective travelling purchaser problem
• A computational study of smoothing heuristics for the traveling salesman problem
• Application of the noising method to the travelling salesman problem
• The n-line traveling salesman problem
• TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer
• Exploiting planarity in separation routines for the symmetric traveling salesman problem
• On the domino-parity inequalities for the STSP
• A note on the traveling salesman problem
• Reducing the Size of Travelling Salesman Problem Instances by Fixing Edges
• Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation
• Title not available (Why is that?)
• The Adult Training Centre Problem: A Case Study
• Technical Note—An Algorithm to Find Elementary Negative-Cost Circuits with a Given Number of Arcs—The Traveling-Salesman Problem
• Optimizing combined tours: the truck-and-cargo-bike case
• A heuristic circulation-network approach to solve the multi-traveling salesman problem
• Local search inequalities
• The common face of some 0/1-polytopes with NP-complete nonadjacency relation
• Using an \(A^\ast\)-based framework for decomposing combinatorial optimization problems to employ NISQ computers
• A heuristic framework on a common generalization of the vehicle routing problem and the linear ordering problem
• Novel concave hull-based heuristic algorithm for TSP
• A new integer programming formulation of the graphical traveling salesman problem
• A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem
• Generating Travelling-Salesman Problems with Known Optimal Tours
• Automated slideshow design from a set of photos based on a hybrid Metaheuristic approach

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4845366)