scientific article; zbMATH DE number 795217
From MaRDI portal
Publication:4845366
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
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)
- 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
- The traveling salesman problem: a deterministic algorithm using tabu search
- Optimizing combined tours: the truck-and-cargo-bike case
- A heuristic circulation-network approach to solve the multi-traveling salesman problem
- Title not available (Why is that?)
- 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
- Generating Travelling-Salesman Problems with Known Optimal Tours
- Automated slideshow design from a set of photos based on a hybrid Metaheuristic approach
- A New Application of the Traveling Salesman Problem: The Turkish Cashier Problem
- The traveling salesman problem and its variations
- On the facial structure of symmetric and graphical traveling salesman polyhedra
- Computing and Combinatorics
- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
- Travelling Salesman with a Self-Similar Itinerary
- Developing a procedure to obtain knowledge of optimum solutions in a travelling salesman problem
- Directed travelling salesman problem
- A noisy Euclidean traveling salesman problem: a computational analysis
- A feature-based comparison of local search and the Christofides algorithm for the travelling salesperson problem
- Traveling salesman path problems
- Title not available (Why is that?)
- Improving a constructive heuristic for the general routing problem
- Fat computational complexity and heuristic design for the TSP
- A cutoff time strategy based on the coupon collector's problem
- The stable marriage problem: an interdisciplinary review from the physicist's perspective
- Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem
- Des opérateurs d'échange et une méthode de relaxation pour le problème du voyageur de commerce
- The traveling salesmanpProblem for lines in the plane
- The multi-stripe travelling salesman problem
- A variable neighborhood search algorithm for cost-balanced travelling salesman problem
- Traveling salesman problem at the post of Slovenia
- An alternate formulation of the symmetric traveling salesman problem and its properties
- Title not available (Why is that?)
- A computational study of smoothing heuristics for the traveling salesman problem
- A multi-algorithm approach for operational human resources workload balancing in a last mile urban delivery system
- Routing one million customers in a handful of minutes
- Tolerance-based Algorithms for the Traveling Salesman Problem
- Gale's Round-Trip Jeep Problem
- In pursuit of the traveling salesman. Mathematics at the limits of computation
- 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 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?)
- Solving the family traveling salesman problem
- 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 on-line asymmetric traveling salesman problem
- The moving-target traveling salesman problem
- 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
- Worst-case analysis of a new heuristic for the travelling salesman problem
- On a linear-programming, combinatorial approach to the traveling-salesman problem
- The traveling salesman problem: the spectral radius and the length of an optimal tour
- 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
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)
