Algorithmic expedients for the prize collecting Steiner tree problem
type: Item
instance of: scholarly article
title: Algorithmic expedients for the prize collecting Steiner tree problem
zbMATH Open document ID: 1271.90097
author: Mohamed Haouari
author: Safa Bhar Layeb
author: Hanif D. Sherali
published in: Discrete Optimization
publication date: 2013-05-31T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6168919
zbMATH Keywords: Steiner tree
zbMATH Keywords: reduction techniques
zbMATH Keywords: worst-case analysis
zbMATH Keywords: valid inequalities
describes a project that uses: SteinLib
MaRDI profile type: Publication
full work available at URL: j.disopt.2010.01.001
OpenAlex ID: W2087987937
cites work: The NP-completeness column: an ongoing guide
cites work: Algorithms - ESA 2003
cites work: The prize collecting traveling salesman problem
cites work: A note on the prize collecting traveling salesman problem
cites work: Q4952698
cites work: Local search with perturbations for the prize-collecting Steiner tree problem in graphs
cites work: Strong lower bounds for the prize collecting Steiner problem in graphs
cites work: A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
cites work: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
cites work: A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
cites work: The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
cites work: An SST-based algorithm for the steiner problem in graphs
cites work: The node-weighted steiner tree problem
cites work: Facets of two Steiner arborescence polyhedra
cites work: A comparison of Steiner tree relaxations
cites work: An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs
cites work: Conjugate gradient methods using quasi-Newton updates with inexact line searches
cites work: Some generalizations of the steiner problem in graphs
cites work: Q3056948
cites work: The shortest route problem with constraints
DOI: 10.1016/J.DISOPT.2010.01.001
description: scientific article; zbMATH DE number 6168919