Strong lower bounds for the prize collecting Steiner problem in graphs
type: Item
instance of: scholarly article
title: Strong lower bounds for the prize collecting Steiner problem in graphs
zbMATH Open document ID: 1056.90119
DOI: 10.1016/S0166-218X(03)00380-9
author: Abilio Lucena
author: Mauricio G. C. Resende
published in: Discrete Applied Mathematics
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 2083797
zbMATH Keywords: Prize collecting Steiner problem in graphs
zbMATH Keywords: Linear programming relaxation
zbMATH Keywords: Lower bound
describes a project that uses: OR-Library
describes a project that uses: SteinLib
describes a project that uses: CPLEX
MaRDI profile type: Publication
cites work: Q3056948
cites work: The prize collecting traveling salesman problem
cites work: A note on the prize collecting traveling salesman problem
cites work: Local search with perturbations for the prize-collecting Steiner tree problem in graphs
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Matroids and the greedy algorithm
cites work: The Steiner tree polytope and related polyhedra
cites work: Q3002852
cites work: Q4952698
cites work: Solving Steiner tree problems in graphs to optimality
cites work: Q4355916
cites work: Tree polytope on 2-trees
cites work: Trees and Cuts
cites work: A Graph-Theoretic Equivalence for Integer Programs
cites work: The node-weighted steiner tree problem
description: scientific article; zbMATH DE number 2083797