A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem

DOI10.1016/j.endm.2009.11.018zbMath1268.05203OpenAlexW1977600534MaRDI QIDQ2840522

Edna A. Hoshino, Cid Carvalho De Souza

Publication date: 19 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.018

zbMATH Keywords

integer programmingcombinatorial optimizationbranch-and-cut-and-pricering-star

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Optimal capacitated ring trees ⋮ A branch‐and‐cut algorithm for the ring spur assignment problem ⋮ Heuristic and exact algorithms for a min-max selective vehicle routing problem ⋮ An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem ⋮ A decomposition algorithm for the ring spur assignment problem ⋮ School bus routing—a column generation approach

Uses Software

• TSPLIB

Cites Work

• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• The Capacitated m-Ring-Star Problem
• Column Generation Algorithms for the Capacitated m-Ring-Star Problem
• TSPLIB—A Traveling Salesman Problem Library
• Unnamed Item

This page was built for publication: A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem