Lagrange dual bound computation for stochastic service network design
Lists
Only you see this
Abstract
Highlights•Lower bounds play an important role in SSND algorithm development.•A Lagrange dual bound of SSND is developed by introducing scenario bundling into scenario-wise decomposition.•Theoretical analysis establishes the superiority of bundling-wise decomposition bound over scenario-wise ones.•Computational experiments on SSND instances confirms the theoretical analysis.
BibTeX
@article{jiang2022lagrange,
author = {Xiaoping Jiang and Ruibin Bai and Jianfeng Ren and Jiawei Li and Graham Kendall},
title = {{Lagrange dual bound computation for stochastic service network design}},
journal = {Eur. J. Oper. Res.},
year = {2022},
url = {https://openreview.net/forum?id=AHnvA8Wku8},
}Loading related content...