A branch-and-cut-and-price approach for the capacitated m-ring-star problem

DOI10.1016/J.ENDM.2009.11.018MaRDI QIDQ2840522zbMATH OpenOpenAlexFDO

Authors 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

combinatorial optimizationinteger programmingbranch-and-cut-and-pricering-star

Mathematics Subject Classification ID

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

Recommendations

• A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
• Column Generation Algorithms for the Capacitated m-Ring-Star Problem
• An integer linear programming formulation and branch-and-cut algorithm for the capacitated \(m\)-ring-star problem
• An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
• The Capacitated m-Ring-Star Problem

Cites work

• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• Column Generation Algorithms for the Capacitated m-Ring-Star Problem
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• TSPLIB—A Traveling Salesman Problem Library
• The Capacitated m-Ring-Star Problem

Cited in

(13)

• Column Generation Algorithms for the Capacitated m-Ring-Star Problem
• A branch-and-cut for the Non-Disjointm-Ring-Star Problem
• An exact algorithm for solving the ring star problem
• Optimal capacitated ring trees
• A heuristic procedure for the capacitated \(m\)-ring-star problem
• An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
• A decomposition algorithm for the ring spur assignment problem
• Heuristic and exact algorithms for a min-max selective vehicle routing problem
• Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
• A branch-and-cut algorithm for the ring spur assignment 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
• School bus routing -- a column generation approach

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: A branch-and-cut-and-price approach 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 Q2840522)