Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6892867 | Computers & Operations Research | 2015 | 11 Pages |
Abstract
In this paper, we present a systematic approach based on a polynomial separation problem to compute such cuts. Then, we apply this technique to a well-known problem of energy management, i.e., the scheduling of the nuclear outages which is a combinatorial problem with quadratic objective and non-convex quadratic constraints. This leads to the identification of some relevant cutting planes for this problem, allowing an average enhancement of 25% of the semidefinite relaxation compared to the linear relaxation.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Agnès Gorge, Abdel Lisser, Riadh Zorgati,