Article ID Journal Published Year Pages File Type
6892610 Computers & Operations Research 2018 20 Pages PDF
Abstract
In this paper we propose two general mathematical programming models for the PPP: a single-level and a bilevel integer programming model. To strengthen both formulations, we derive new valid inequalities and promote variable fixing. Furthermore, to tackle the bilevel model, we devise a cutting plane algorithm amended with particular features that improve its efficiency. The efficiency of the algorithm is validated through computational experiments. Results show that this new approach is more efficient than state-of-the-art proposals.
Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Authors
, , ,