The \(p\)-arborescence star problem: formulations and exact solution approaches

DOI10.1016/j.cor.2018.10.004zbMath1458.90616OpenAlexW2894549539WikidataQ129150756 ScholiaQ129150756MaRDI QIDQ1628121

Geraldo Robson Mateus, Vinicius Morais, Bernard Gendron

Publication date: 3 December 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.10.004

zbMATH Keywords

wireless sensor networksarborescencecutting-plane method

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (4)

Branch‐and‐cut algorithms for the ‐arborescence star problem ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Precedence-constrained arborescences ⋮ A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Branch-and-cut-and-price for capacitated connected facility location
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• MIP models for connected facility location: a theoretical and computational study
• The tree of hubs location problem
• A Benders decomposition based framework for solving cable trench problems
• The connected facility location polytope
• An algorithmic framework for the exact solution of tree-star problems
• Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
• The General Steiner Tree-Star problem.
• Primal-dual algorithms for connected facility location problems
• Locating median cycles in networks
• A cutting plane algorithm for the capacitated connected facility location problem
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
• Dual-Based Local Search for the Connected Facility Location and Related Problems
• Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
• The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm
• MIP Modeling of Incremental Connected Facility Location
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• The Capacitated m-Ring-Star Problem
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimum branchings
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• The cable trench problem: Combining the shortest path and minimum spanning tree problems

This page was built for publication: The \(p\)-arborescence star problem: formulations and exact solution approaches