An algorithmic framework for the exact solution of tree-star problems
type: Item
instance of: scholarly article
title: An algorithmic framework for the exact solution of tree-star problems
zbMATH Open document ID: 1403.90577
author: Markus Leitner
author: Ivana Ljubić
author: Juan-José Salazar-González
author: Markus Sinnl
published in: European Journal of Operational Research
publication date: 2018-05-29T00:00:00Z
full work available at URL: ConFLthinning TR.pdf
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6875847
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: connected facility location
zbMATH Keywords: branch-and-cut
zbMATH Keywords: dual ascent
zbMATH Keywords: Benders decomposition
describes a project that uses: SteinLib
describes a project that uses: OR-Library
MaRDI profile type: Publication
OpenAlex ID: W2588888080
Wikidata QID: Q57705353
cites work: Dual-based local search for the connected facility location and related problems
cites work: Approximation Algorithms for Directed Steiner Problems
cites work: Digital data networks design using genetic algorithms
cites work: Connected facility location via random facility sampling and core detouring
cites work: Q4707782
cites work: MIP models for connected facility location: a theoretical and computational study
cites work: Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
cites work: The Push Tree problem
cites work: The General Steiner Tree-Star problem.
cites work: Solving Steiner tree problems in graphs to optimality
cites work: On the exact solution of large-scale simple plant location problems
cites work: Solving the simple plant location problem by genetic algorithm
cites work: Approximation algorithms for data management in networks
cites work: A Branch and Cut Algorithm for a Steiner Tree-Star Problem
cites work: On the Asymmetric Connected Facility Location Polytope
cites work: Branch-and-cut-and-price for capacitated connected facility location
cites work: Hybrid metaheuristics. 4th international workshop, HM 2007, Dortmund, Germany, October 8--9, 2007. Proceedings
cites work: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
cites work: A faster approximation algorithm for the Steiner problem in graphs
cites work: Improved algorithms for the Steiner problem in networks
cites work: Primal-dual algorithms for connected facility location problems
cites work: A dual ascent approach for steiner tree problems on a directed graph
DOI: 10.1016/J.EJOR.2017.02.011
DBLP publication ID: journals/eor/LeitnerLGS17
description: scientific article; zbMATH DE number 6875847