The symmetric generalized traveling salesman polytope
DOI10.1002/NET.3230260206zbMATH Open0856.90116OpenAlexW1972335984MaRDI QIDQ4894874FDOQ4894874
Authors: Matteo Fischetti, Juan-José Salazar-González, Paolo Toth 
Publication date: 13 November 1996
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230260206
Recommendations
polytopesroutinginteger linear programslocation-routingbranch-and-cut algorithmfacial structuresymmetric generalized traveling salesman problem
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
Cited In (41)
- The multicolored graph realization problem
- The Steiner cycle polytope
- New mathematical models of the generalized vehicle routing problem and extensions
- A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines
- The generalized minimum spanning tree: polyhedra and branch-and-cut
- A discrete state transition algorithm for generalized traveling salesman problem
- SYMMETRIC ITINERARY SETS
- A two-level metaheuristic for the all colors shortest path problem
- An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
- The Crown Inequalities for the Symmetric Traveling Salesman Polytope
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
- Solving the family traveling salesman problem
- A note on the generalized Steiner tree polytope
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm
- Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
- A cutting plane approach to solve the railway traveling salesman problem
- The generalized minimum branch vertices problem: properties and polyhedral analysis
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- Heuristics for a cash-collection routing problem with a cluster-first route-second approach
- An integer L-shaped method for the generalized vehicle routing problem with stochastic demands
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
- On generalized minimum spanning trees
- Transformations of generalized ATSP into ATSP.
- A metaheuristic to solve a location-routing problem with nonlinear costs
- A beam search for the equality generalized symmetric traveling salesman problem
- Solving a generalized traveling salesperson problem with stochastic customers
- On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms
- An efficient transformation of the generalized vehicle routing problem
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
- A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool
- Generalized network design problems.
- A random-key genetic algorithm for the generalized traveling salesman problem
- Discrete/Binary approach
- Not Every GTSP Facet Induces an STSP Facet
- A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem
- SONET/SDH ring assignment with capacity constraints
- On symmetric subtour problems
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- Generalized network design polyhedra
This page was built for publication: The symmetric generalized traveling salesman polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4894874)
