A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
From MaRDI portal
Publication:4367232
Recommendations
- The symmetric generalized traveling salesman polytope
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
- Some Applications of the Generalized Travelling Salesman Problem
Cited in
(only showing first 100 items - show all)- A new class of cutting planes for the symmetric travelling salesman problem
- An efficient composite heuristic for the symmetric generalized traveling salesman problem
- Transformations of generalized ATSP into ATSP.
- A two-level metaheuristic for the all colors shortest path problem
- Layered graph approaches for combinatorial optimization problems
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
- The probabilistic orienteering problem
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems
- Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout
- Revisiting the Hamiltonian p-median problem: a new formulation on directed graphs and a branch-and-cut algorithm
- Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants
- The set orienteering problem
- Large multiple neighborhood search for the clustered vehicle-routing problem
- An integer programming-based local search for the covering salesman problem
- Generalized network design problems.
- Locating median cycles in networks
- A note on the generalized Steiner tree polytope
- An efficient transformation of the generalized vehicle routing problem
- Branch-and-bound for the precedence constrained generalized traveling salesman problem
- A biased random-key genetic algorithm for the set orienteering problem
- The generalized minimum branch vertices problem: properties and polyhedral analysis
- Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem
- Spatial coverage in routing and path planning problems
- A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
- Liner shipping network design
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
- On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms
- The undirected \(m\)-capacitated peripatetic salesman problem
- Exact solution of the soft-clustered vehicle-routing problem
- The clustered team orienteering problem
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- A branch-and-cut algorithm for the maximum covering cycle problem
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
- Particle swarm optimization-based algorithms for TSP and generalized TSP
- New mathematical models of the generalized vehicle routing problem and extensions
- The prize-collecting generalized minimum spanning tree problem
- Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
- A new relaxation method for the generalized minimum spanning tree problem
- The mixed capacitated general routing problem under uncertainty
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem
- The capacitated arc routing problem with intermediate facilities
- The generalized covering salesman problem
- Upper and lower bounding procedures for the minimum caterpillar spanning problem
- Optimal capacitated ring trees
- A variable neighborhood search and its application to a ring star problem generalization
- An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
- A discrete state transition algorithm for generalized traveling salesman problem
- Efficient elementary and restricted non-elementary route pricing
- A two-stage vehicle routing model for large-scale bioterrorism emergencies
- The generalized minimum edge-biconnected network problem: efficient neighborhood structures for variable neighborhood search
- Solving the job sequencing and tool switching problem as a nonlinear least cost Hamiltonian cycle problem
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
- A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
- The production routing problem: a review of formulations and solution algorithms
- A cutting plane approach to solve the railway traveling salesman problem
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
- A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds
- Discrete/Binary approach
- Modeling and solving the mixed capacitated general routing problem
- scientific article; zbMATH DE number 1123081 (Why is no real title available?)
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
- scientific article; zbMATH DE number 1933055 (Why is no real title available?)
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- The symmetric generalized traveling salesman polytope
- Eulerian location problems
- Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
- A beam search for the equality generalized symmetric traveling salesman problem
- A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem
- Multiple depot ring star problem: a polyhedral study and an exact algorithm
- A Sensitive Metaheuristic for Solving a Large Optimization Problem
- Cluster-level operations planning for the out-of-position robotic arc-welding
- Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem
- Facets of the p-cycle polytope
- Mixed integer programming formulations for the generalized traveling salesman problem with time windows
- A learn‐and‐construct framework for general mixed‐integer programming problems
- An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search
- A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm
- An adaptive memory matheuristic for the set orienteering problem
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
- A heuristic procedure for the capacitated m-ring-star problem
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
- The cumulative school bus routing problem: Polynomial‐size formulations
- A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
- The traveling purchaser problem with stochastic prices: exact and approximate algorithms
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
- Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem
- New path elimination constraints for multi-depot routing problems
- Modeling and solving the two-level generalized median tour problem
- An effective hybrid evolutionary algorithm for the clustered orienteering problem
- A comprehensive survey on the generalized traveling salesman problem
- The multicolored graph realization problem
- Shore hydrogen deployment problem in green ports
This page was built for publication: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4367232)
