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

DOI10.1016/j.dam.2011.11.029zbMath1262.90182OpenAlexW2173395596MaRDI QIDQ1759849

Edna A. Hoshino, Cid Carvalho De Souza

Publication date: 22 November 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.11.029

zbMATH Keywords

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (11)

A branch-and-price algorithm for the ring-tree facility location problem ⋮ Exact algorithms for budgeted prize-collecting covering subgraph problems ⋮ MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem ⋮ Capacitated \(m\) two-node survivable star problem ⋮ Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms ⋮ New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems ⋮ A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand ⋮ A branch-and-price algorithm for a vehicle routing with demand allocation problem ⋮ School bus routing—a column generation approach ⋮ A covering traveling salesman problem with profit in the last mile delivery ⋮ The capacitated m two node survivable star problem

Uses Software

• TSPLIB
• CVRPSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Column Generation Algorithms for the Capacitated m-Ring-Star Problem
• TSPLIB—A Traveling Salesman Problem Library
• On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem

This page was built for publication: A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem