Solving minimum-cost shared arborescence problems
From MaRDI portal
Publication:1751722
DOI10.1016/j.ejor.2016.11.004zbMath1394.90429OpenAlexW2555385204MaRDI QIDQ1751722
Markus Sinnl, Martin Luipersbeck, Ivana Ljubić, Eduardo Álvarez-Miranda
Publication date: 25 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.11.004
Programming involving graphs or networks (90C35) Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Benders decomposition without separability: a computational study for capacitated facility location problems
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Thinning out Steiner trees: a node-based model for uniform edge costs
- A survey on Benders decomposition applied to fixed-charge network design problems
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
- A dual ascent approach for steiner tree problems on a directed graph
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- An In-Out Approach to Disjunctive Optimization
- Tailoring Benders decomposition for uncapacitated network design
- Reduction tests for the steiner problem in grapsh
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Solving Steiner tree problems in graphs to optimality
- On implementing push-relabel method for the maximum flow problem
- Improved algorithms for the Steiner problem in networks
This page was built for publication: Solving minimum-cost shared arborescence problems
