A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem
From MaRDI portal
Publication:1651621
DOI10.1016/j.cor.2015.12.015zbMath1391.90593OpenAlexW2211667058MaRDI QIDQ1651621
Ivo Kwee, Roberto Montemanni, Murodzhon Akhmedov
Publication date: 12 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.12.015
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (3)
A relax-and-cut framework for large-scale maximum weight connected subgraph problems ⋮ On the Exact Solution of Prize-Collecting Steiner Tree Problems ⋮ A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks
Uses Software
Cites Work
- Unnamed Item
- A note on the prize collecting traveling salesman problem
- Thinning out Steiner trees: a node-based model for uniform edge costs
- Strong lower bounds for the prize collecting Steiner problem in graphs
- Algorithmic expedients for the prize collecting Steiner tree problem
- Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks
- A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint
- A Comparison of Heuristic Methods for the Prize-Collecting Steiner Tree Problem and Their Application in Genomics
- Algorithms - ESA 2003
This page was built for publication: A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem
