Cargando…
Decomposition methods for the two-stage stochastic Steiner tree problem
A new algorithmic approach for solving the stochastic Steiner tree problem based on three procedures for computing lower bounds (dual ascent, Lagrangian relaxation, Benders decomposition) is introduced. Our method is derived from a new integer linear programming formulation, which is shown to be str...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2017
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6566287/ https://www.ncbi.nlm.nih.gov/pubmed/31258249 http://dx.doi.org/10.1007/s10589-017-9966-x |