Exact approaches for solving robust prize-collecting Steiner tree problems
- 6 April 2013
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 229 (3) , 599-612
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Finding undetected protein associations in cell signaling by belief propagationProceedings of the National Academy of Sciences, 2010
- Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problemsMathematical Programming, 2010
- Integrating Proteomic, Transcriptional, and Interactome Data Reveals Hidden Components of Signaling and Regulatory NetworksScience Signaling, 2009
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approachesComputational Optimization and Applications, 2007
- A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problemComputers & Operations Research, 2006
- Adjustable robust solutions of uncertain linear programsMathematical Programming, 2004
- Robust discrete optimization and network flowsMathematical Programming, 2003
- Local search with perturbations for the prize‐collecting Steiner tree problem in graphsNetworks, 2001
- The prize collecting traveling salesman problemNetworks, 1989
- The node‐weighted steiner tree problemNetworks, 1987