A branch-and-price algorithm for the ring-tree facility location problem
From MaRDI portal
Publication:2132327
DOI10.1016/j.entcs.2019.08.002OpenAlexW2977272969WikidataQ113317431 ScholiaQ113317431MaRDI QIDQ2132327
Alessandro Hill, Edna A. Hoshino, Roberto Baldacci, Fabio Henrique N. Abe
Publication date: 27 April 2022
Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.002
Related Items (1)
Uses Software
Cites Work
- Optimal capacitated ring trees
- The ring tree facility location problem
- A column generation approach for a school bus routing problem with resource constraints
- A branch-and-cut algorithm for two-level survivable network design problems
- SCIP: solving constraint integer programs
- The school bus routing problem: a review
- Exact algorithms for bi-objective ring tree problems with reliability measures
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
- Generalized local branching heuristics and the capacitated ring tree problem
- A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
- Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
- Greedy randomized adaptive search procedures
- Capacitated ring arborescence problems with profits
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- Multi-exchange Neighborhoods for the Capacitated Ring Tree Problem
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- The Capacitated m-Ring-Star Problem
- A Method for Solving Traveling-Salesman Problems
- Optimum branchings
This page was built for publication: A branch-and-price algorithm for the ring-tree facility location problem
