Multiple depot ring star problem: a polyhedral study and an exact algorithm

DOI10.1007/S10898-016-0431-7zbMath1366.90185arXiv1407.5080OpenAlexW2950370704MaRDI QIDQ513163

Kaarthik Sundar, Sivakumar Rathinam

Publication date: 3 March 2017

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.5080

zbMATH Keywords

resource allocationtelecommunicationsbranch-and-cutpolyhedral studyautonomous vehiclesdata collection

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (7)

The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach ⋮ Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm ⋮ Compact formulations for multi-depot routing problems: theoretical and computational comparisons ⋮ The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods ⋮ The caterpillar-packing polytope ⋮ A covering traveling salesman problem with profit in the last mile delivery ⋮ Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope

Uses Software

• TSPLIB
• CPLEX
• LKH
• Concorde
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Multi-depot multiple TSP: a polyhedral study and computational results
• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• Heuristic algorithms for the multi-depot ring-star problem
• Variable neighborhood tabu search and its application to the median cycle problem.
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
• Branching rules revisited
• Locating median cycles in networks
• Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search
• A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
• The Capacitated m-Ring-Star Problem
• An exact algorithm for solving the ring star problem
• Odd Minimum Cut-Sets and b-Matchings
• TSPLIB—A Traveling Salesman Problem Library
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• A comparison of several models for the hamiltonian p‐median problem

This page was built for publication: Multiple depot ring star problem: a polyhedral study and an exact algorithm