A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
type: Item
instance of: scholarly article
title: A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
zbMATH Open document ID: 1173.90573
author: Alexandre Salles da Cunha
author: Abilio Lucena
author: Mauricio G. C. Resende
author: Nelson Maculan
published in: Discrete Applied Mathematics
publication date: 2009-06-23T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 5569102
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: non delayed relax-and-cut
zbMATH Keywords: prize-collecting Steiner problem in graphs
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: j.dam.2008.02.014
OpenAlex ID: W2058433703
cites work: The prize collecting traveling salesman problem
cites work: An algorithm for the steiner problem in graphs
cites work: Lagrangean heuristics for location problems
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: Lower and upper bounds for the degree-constrained minimum spanning tree problem
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Efficient path and vertex exchange in steiner tree algorithms
cites work: Q3002852
cites work: Steiner's problem in graphs and its implications
cites work: A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
cites work: Q4952698
cites work: Reducibility among Combinatorial Problems
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
cites work: Non delayed relax-and-cut algorithms
cites work: Strong lower bounds for the prize collecting Steiner problem in graphs
cites work: Q4519136
cites work: Edge exchanges in the degree-constrained minimum spanning tree problem
cites work: The node-weighted steiner tree problem
cites work: The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
DOI: 10.1016/J.DAM.2008.02.014
description: scientific article; zbMATH DE number 5569102