Column Generation Algorithms for the Capacitated m-Ring-Star Problem

DOI10.1007/978-3-540-69733-6_62zbMath1148.90345OpenAlexW1503763835MaRDI QIDQ3511375

Edna A. Hoshino, Cid Carvalho De Souza

Publication date: 10 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_62

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Traffic problems in operations research (90B20)

Related Items

A heuristic procedure for the capacitated \(m\)-ring-star problem ⋮ An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem ⋮ A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem ⋮ Upper and lower bounding procedures for the minimum caterpillar spanning problem ⋮ A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem ⋮ An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
• The vehicle routing-allocation problem: A unifying framework
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
• The Capacitated m-Ring-Star Problem
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• TSPLIB—A Traveling Salesman Problem Library
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• Shortest Path Problems with Resource Constraints
• On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem