The symmetric generalized traveling salesman polytope
From MaRDI portal
Publication:4894874
DOI10.1002/net.3230260206zbMath0856.90116OpenAlexW1972335984MaRDI QIDQ4894874
Paolo Toth, Matteo Fischetti, Juan-José Salazar-González
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
polytopesbranch-and-cut algorithmroutinginteger linear programslocation-routingfacial 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)
Related Items
The Steiner cycle polytope, A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines, 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, An integer L-shaped method for the generalized vehicle routing problem with stochastic demands, Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm, A random-key genetic algorithm for the generalized traveling salesman problem, GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem, Solving a generalized traveling salesperson problem with stochastic customers, Unnamed Item, A Discrete State Transition Algorithm for Generalized Traveling Salesman Problem, Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem, Heuristics for a cash-collection routing problem with a cluster-first route-second approach, SONET/SDH ring assignment with capacity constraints, Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm, Transformations of generalized ATSP into ATSP., New mathematical models of the generalized vehicle routing problem and extensions, The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm, Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem, A note on the generalized Steiner tree polytope, An efficient transformation of the generalized vehicle routing problem, A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem, On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms, Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem, A metaheuristic to solve a location-routing problem with nonlinear costs, On generalized minimum spanning trees, A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool, 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, Generalized network design problems., The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm, Generalized network design polyhedra, Discrete/Binary Approach
Cites Work
