Branch‐and‐cut algorithms for the ‐arborescence star problem
From MaRDI portal
Publication:6071060
DOI10.1111/itor.12857OpenAlexW3048409432MaRDI QIDQ6071060
Geraldo Robson Mateus, Sebastián Urrutia, Armando Honorio Pereira
Publication date: 27 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12857
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The tree-star problem: a formulation and a branch-and-cut algorithm
- MIP models for connected facility location: a theoretical and computational study
- Reformulations and solution algorithms for the maximum leaf spanning tree problem
- Combinatorial mathematics. Proceedings of the International Colloquium on Graph Theory and Combinatorics, Marseille-Luminy, June 1981
- An exact algorithm for the maximum leaf spanning tree problem.
- Data-gathering wireless sensor networks: organization and capacity.
- The \(p\)-arborescence star problem: formulations and exact solution approaches
- A Benders decomposition based framework for solving cable trench problems
- Spanning trees with a constraint on the number of leaves. A new formulation
- 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
- Upper and lower bounding procedures for the minimum caterpillar spanning problem
- 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
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- The Capacitated m-Ring-Star Problem
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- The maximum-leaf spanning tree problem: Formulations and facets
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum branchings
- The cable trench problem: Combining the shortest path and minimum spanning tree problems
- Configuration‐based approach for topological problems in the design of wireless sensor networks
This page was built for publication: Branch‐and‐cut algorithms for the ‐arborescence star problem