The symmetric generalized traveling salesman polytope
From MaRDI portal
Publication:4894874
Recommendations
Cited in
(41)- The Steiner cycle polytope
- The multicolored graph realization problem
- A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines
- New mathematical models of the generalized vehicle routing problem and extensions
- 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
- 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
- A cutting plane approach to solve the railway traveling salesman problem
- 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
- Transformations of generalized ATSP into ATSP.
- On generalized minimum spanning trees
- A metaheuristic to solve a location-routing problem with nonlinear costs
- Solving a generalized traveling salesperson problem with stochastic customers
- A beam search for the equality generalized symmetric traveling salesman problem
- 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
- A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
- A random-key genetic algorithm for the generalized traveling salesman problem
- Generalized network design problems.
- A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem
- Discrete/Binary approach
- Not Every GTSP Facet Induces an STSP Facet
- 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)
