scientific article; zbMATH DE number 795217
From MaRDI portal
Publication:4845366
zbMATH Open0832.90118MaRDI QIDQ4845366FDOQ4845366
Gerhard Reinelt, G. Rinaldi, Michael Jünger
Publication date: 5 March 1996
Title of this publication is not available (Why is that?)
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 (82)
- Title not available (Why is that?)
- Optimizing combined tours: the truck-and-cargo-bike case
- 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
- A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem
- Automated slideshow design from a set of photos based on a hybrid Metaheuristic approach
- Computing and Combinatorics
- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
- Improving a constructive heuristic for the general routing problem
- A cutoff time strategy based on the coupon collector's problem
- Title not available (Why is that?)
- 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
- Gale's Round-Trip Jeep Problem
- Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation
- 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
- New facets of the STS polytope generated from known facets of the ATS polytope
- Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time
- 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
- 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
- Local search inequalities
- The common face of some 0/1-polytopes with NP-complete nonadjacency relation
- 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
- Novel concave hull-based heuristic algorithm for TSP
- A new integer programming formulation of the graphical traveling salesman problem
- Title not available (Why is that?)
- Pyramidal traveling salesman problem
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- Traveling salesman problem
- Title not available (Why is that?)
- 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
- Travelling Salesman with a Self-Similar Itinerary
- Title not available (Why is that?)
- Heuristic and exact algorithms for a min-max selective vehicle routing problem
- The hierarchical traveling salesman problem
- Directed travelling 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
- Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time
- Optimal arcs for the traveling salesman 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
- 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
- The multi-stripe travelling salesman problem
- 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?)
- Distances between traveling salesman tours
- 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
- Exploiting planarity in separation routines for the symmetric traveling salesman problem
- On the domino-parity inequalities for the STSP
Recommendations
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)
