Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Álinson S. Xavier"'
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783031327254
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad39e21b8995e5f78b7244ff9112d7ea
https://doi.org/10.1007/978-3-031-32726-1_25
https://doi.org/10.1007/978-3-031-32726-1_25
Publikováno v:
IEEE Transactions on Power Systems. 34:2457-2460
When solving the security-constrained unit commitment problem, one of the most complicating factors is handling the large number of transmission constraints, corresponding to both base case and N − 1 line contingency scenarios. Although it is well
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e88eea69a5838eed3c497caa2ac7ba67
https://doi.org/10.1109/tpwrs.2019.2892620
https://doi.org/10.1109/tpwrs.2019.2892620
Publikováno v:
Mathematical Programming Computation. 11:211-235
When generating cutting-planes for mixed-integer programs from multiple rows of the simplex tableau, the usual approach has been to relax the integrality of the non-basic variables, compute an intersection cut, then strengthen the cut coefficients co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1016722d5632693c72d732530da7c970
https://doi.org/10.1007/s12532-018-0146-5
https://doi.org/10.1007/s12532-018-0146-5
Publikováno v:
Mathematical Programming Computation. 10:423-455
We consider the problem of generating inequalities that are valid for one-row relaxations of a simplex tableau, with the integrality constraints preserved for one or more non-basic variables. These relaxations are interesting because they can be used
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1dd28a27de7c121a7dabc8cef0475377
https://doi.org/10.1007/s12532-018-0132-y
https://doi.org/10.1007/s12532-018-0132-y
Security-constrained unit commitment (SCUC) is a fundamental problem in power systems and electricity markets. In practical settings, SCUC is repeatedly solved via mixed-integer linear programming (MIP), sometimes multiple times per day, with only mi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ff244b44dd20689fcc7d945747293094
Autor:
Álinson S. Xavier, Manoel B. Campêlo
Publikováno v:
Electronic Notes in Discrete Mathematics. 37:183-188
We introduce a new facet-generating procedure for the stable set polytope, based on replacing ( k − 1 )-cliques with certain k-partite graphs, which subsumes previous procedures based on replacing vertices with stars, and thus also many others in t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5643efcfec7ca99feacbfd9b5205da4c
https://doi.org/10.1016/j.endm.2011.05.032
https://doi.org/10.1016/j.endm.2011.05.032