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

DOI10.1007/978-3-540-69733-6_62MaRDI QIDQ3511375zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
• A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
• The Capacitated m-Ring-Star Problem
• Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
• An integer linear programming formulation and branch-and-cut algorithm for the capacitated m-ring-star problem

Cites work

• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• scientific article; zbMATH DE number 3356467 (Why is no real title available?)
• Network flows. Theory, algorithms, and applications.
• On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Shortest Path Problems with Resource Constraints
• The Capacitated m-Ring-Star Problem
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• The shortest-path problem with resource constraints and k-cycle elimination for k 3
• The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
• The vehicle routing-allocation problem: A unifying framework
• TSPLIB—A Traveling Salesman Problem Library

Cited in

(9)

• A column generation approach to capacitated p-median problems
• Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
• 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
• The Capacitated m-Ring-Star Problem
• An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
• A heuristic procedure for the capacitated m-ring-star problem

This page was built for publication: Column Generation Algorithms for the Capacitated m-Ring-Star Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511375)