Branch‐and‐cut algorithms for the ‐arborescence star problem

DOI10.1111/ITOR.12857MaRDI QIDQ6071060zbMATH OpenOpenAlexFDO

Authors Armando Honorio Pereira, Geraldo Robson Mateus, Sebastián Urrutia

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

zbMATH Keywords

arborescencebranch-and-cutinteger programmingwireless sensor networks

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• A Benders decomposition based framework for solving cable trench problems
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• An algorithmic framework for the exact solution of tree-star problems
• An exact algorithm for the maximum leaf spanning tree problem.
• Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
• Combinatorial mathematics. Proceedings of the International Colloquium on Graph Theory and Combinatorics, Marseille-Luminy, June 1981
• Configuration‐based approach for topological problems in the design of wireless sensor networks
• Data-gathering wireless sensor networks: organization and capacity.
• scientific article; zbMATH DE number 795222 (Why is no real title available?)
• scientific article; zbMATH DE number 3285076 (Why is no real title available?)
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• Introduction to algorithms.
• Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
• MIP models for connected facility location: a theoretical and computational study
• Optimum branchings
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Primal-dual algorithms for connected facility location problems
• Reformulations and solution algorithms for the maximum leaf spanning tree problem
• Spanning trees with a constraint on the number of leaves. A new formulation
• The p-arborescence star problem: formulations and exact solution approaches
• The cable trench problem: Combining the shortest path and minimum spanning tree problems
• The Capacitated m-Ring-Star Problem
• The General Steiner Tree-Star problem.
• The maximum-leaf spanning tree problem: Formulations and facets
• The minimum connected dominating set problem: formulation, valid inequalities and a branch-and-cut algorithm
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• The tree-star problem: a formulation and a branch-and-cut algorithm
• Upper and lower bounding procedures for the minimum caterpillar spanning problem

Cited in

(3)

• The complete optimal stars-clustering-tree problem
• A branch-and-cut for the Non-Disjointm-Ring-Star Problem
• An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search

This page was built for publication: Branch‐and‐cut algorithms for the ‐arborescence star problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6071060)