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)- Randomized gravitational emulation search algorithm for symmetric traveling salesman problem
- Locating median cycles in networks
- The prize-collecting generalized minimum spanning tree problem
- Spatial coverage in routing and path planning problems
- A variable neighborhood search and its application to a ring star problem generalization
- An integer programming-based local search for the covering salesman problem
- Facets of the \(p\)-cycle polytope
- scientific article; zbMATH DE number 1933055 (Why is no real title available?)
- A biased random-key genetic algorithm for the set orienteering problem
- A new relaxation method for the generalized minimum spanning tree problem
- Modeling and solving the two-level generalized median tour problem
- Liner shipping network design
- The capacitated arc routing problem with intermediate facilities
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
- Branch-and-bound for the precedence constrained generalized traveling salesman problem
- The probabilistic orienteering 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
- The mixed capacitated general routing problem under uncertainty
- New mathematical models of the generalized vehicle routing problem and extensions
- A two-stage vehicle routing model for large-scale bioterrorism emergencies
- Shore hydrogen deployment problem in green ports
- A Sensitive Metaheuristic for Solving a Large Optimization Problem
- Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants
- Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- A new class of cutting planes for the symmetric travelling salesman problem
- The production routing problem: a review of formulations and solution algorithms
- A discrete state transition algorithm for generalized traveling salesman problem
- The generalized covering salesman problem
- Layered graph approaches for combinatorial optimization problems
- Exact solution of the soft-clustered vehicle-routing problem
- A two-level metaheuristic for the all colors shortest path problem
- Optimal capacitated ring trees
- An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
- A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem
- The set orienteering problem
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
- Solving the family traveling salesman problem
- Efficient elementary and restricted non-elementary route pricing
- A note on the generalized Steiner tree polytope
- A heuristic procedure for the capacitated \(m\)-ring-star problem
- Particle swarm optimization-based algorithms for TSP and generalized TSP
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
- 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
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star 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
- Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem
- Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem
- The undirected \(m\)-capacitated peripatetic salesman problem
- A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group
- The cumulative school bus routing problem: Polynomial‐size formulations
- Mixed integer programming formulations for the generalized traveling salesman problem with time windows
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
- The clustered team orienteering problem
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
- Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
- Modeling and solving the mixed capacitated general routing problem
- Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- A memetic algorithm for the generalized traveling salesman problem
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
- A learn‐and‐construct framework for general mixed‐integer programming problems
- Revisiting the Hamiltonian p-median problem: a new formulation on directed graphs and a branch-and-cut algorithm
- Large multiple neighborhood search for the clustered vehicle-routing problem
- An improved hybrid ant-local search algorithm for the partition graph coloring problem
- Cluster-level operations planning for the out-of-position robotic arc-welding
- A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
- Eulerian location problems
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
- An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search
- The traveling purchaser problem with stochastic prices: exact and approximate algorithms
- On the minimum corridor connection problem and other generalized geometric problems
- Transformations of generalized ATSP into ATSP.
- A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
- New path elimination constraints for multi-depot routing problems
- A tabu search heuristic for the generalized minimum spanning tree problem
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
- An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
- A branch-and-cut algorithm for the maximum covering cycle problem
- Solving a generalized traveling salesperson problem with stochastic customers
- A beam search for the equality generalized symmetric traveling salesman problem
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem
- On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems
- An efficient transformation of the generalized vehicle routing problem
- The generalized fixed-charge network design problem
- Solving the asymmetric traveling purchaser problem
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
- Upper and lower bounding procedures for the minimum caterpillar spanning problem
- 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
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)
