The \(p\)-arborescence star problem: formulations and exact solution approaches
type: Item
instance of: scholarly article
title: The \(p\)-arborescence star problem: formulations and exact solution approaches
zbMATH Open document ID: 1458.90616
author: Vinicius Morais
author: Bernard Gendron
author: Geraldo Robson Mateus
published in: Computers \& Operations Research
publication date: 2018-12-03T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 6988146
zbMATH Keywords: wireless sensor networks
zbMATH Keywords: arborescence
zbMATH Keywords: cutting-plane method
MaRDI profile type: Publication
full work available at URL: j.cor.2018.10.004
OpenAlex ID: W2894549539
cites work: Q4250235
cites work: MIP Modeling of Incremental Connected Facility Location
cites work: The Capacitated m-Ring-Star Problem
cites work: Dual-based local search for the connected facility location and related problems
cites work: A Benders decomposition based framework for solving cable trench problems
cites work: Q5567717
cites work: The tree of hubs location problem
cites work: Optimum branchings
cites work: Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
cites work: Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
cites work: A cutting plane algorithm for the capacitated connected facility location problem
cites work: MIP models for connected facility location: a theoretical and computational study
cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
cites work: Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
cites work: The General Steiner Tree-Star problem.
cites work: The Ring Star Problem: Polyhedral analysis and exact algorithm
cites work: Locating median cycles in networks
cites work: The integer \(L\)-shaped method for stochastic integer programs with complete recourse
cites work: An algorithmic framework for the exact solution of tree-star problems
cites work: The connected facility location polytope
cites work: Branch-and-cut-and-price for capacitated connected facility location
cites work: Q4845371
cites work: Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
cites work: The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm
cites work: Primal-dual algorithms for connected facility location problems
cites work: The cable trench problem: Combining the shortest path and minimum spanning tree problems
cites work: Q4943600
Wikidata QID: Q129150756
DOI: 10.1016/J.COR.2018.10.004
description: scientific article; zbMATH DE number 6988146