Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
7436756 | Omega | 2018 | 26 Pages |
Abstract
We prove NP-hardness of DSCCP and introduce a Lagrangian relaxation model. We design a dual ascent procedure based on acting on a single multiplier at a time accompanied by a heuristics to find a feasible solution at each ascent iteration. We report also the results of the method on several test problems.
Related Topics
Social Sciences and Humanities
Business, Management and Accounting
Strategy and Management
Authors
Annabella Astorino, Manlio Gaudioso, Giovanna Miglionico,