Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Laurent Poirrier"'
Publikováno v:
Mathematical Programming Computation. 12:295-335
Split cuts are arguably the most effective class of cutting planes within a branch-and-cut framework for solving general Mixed-Integer Programs (MIP). Sparsity, on the other hand, is a common characteristic of MIP problems, and it is an important par
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::09d7fd201765166566cc1422b20bdf17
https://doi.org/10.1007/s12532-020-00180-9
https://doi.org/10.1007/s12532-020-00180-9
Autor:
Laurent Poirrier, Ricardo Fukasawa
Publikováno v:
INFORMS Journal on Computing. 31:612-632
The basis matrices corresponding to consecutive iterations of the simplex method only differ in a single column. This fact is commonly exploited in current linear programming solvers to avoid having to compute a new factorization of the basis at ever
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::981d426f6fe50b7c74f6da0e98940371
https://doi.org/10.1287/ijoc.2018.0862
https://doi.org/10.1287/ijoc.2018.0862
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
Autor:
Laurent Poirrier, Ricardo Fukasawa
Publikováno v:
INFORMS Journal on Computing. 29:544-557
The resolution of integer programming problems is typically performed via branch and bound. Nodes of the branch-and-bound tree are pruned whenever the corresponding subproblem is proven not to contain a solution better than the best solution found so
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab3bd78f7481c830c48e64cd53be26ee
https://doi.org/10.1287/ijoc.2017.0747
https://doi.org/10.1287/ijoc.2017.0747
Recently, Bodur, Del Pia, Dey, Molinaro and Pokutta introduced the concept of aggregation cuts for packing and covering integer programs. The aggregation closure is the intersection of all aggregation cuts. Bodur et. al. studied the strength of this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c2e76f5f561dbfa29aa32678fe49958
http://arxiv.org/abs/1910.03404
http://arxiv.org/abs/1910.03404
We consider the three-dimensional stable matching problem with cyclic preferences, a problem originally proposed by Knuth. Despite extensive study of the problem by experts from different areas, the question of whether every instance of this problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d6aadc3f48b82c9e1d036423f36a764
Autor:
Laurent Poirrier, Quentin Louveaux
Publikováno v:
Mathematical Programming. 143:111-146
We consider the question of finding deep cuts from a model with two rows of the type $$P_I=\{(x,s)\in \mathbb{Z }^2\times \mathbb{R }^n_+ : x=f+Rs\}$$ . To do that, we show how to reduce the complexity of setting up the polar of $$\mathop {\mathrm{co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::059f158aaf82fb8f1ab00025a9846e1b
https://doi.org/10.1007/s10107-012-0597-9
https://doi.org/10.1007/s10107-012-0597-9
We develop a method for computing facet-defining valid inequalities for any mixed-integer set $$P_J$$ . While our practical implementation does not return only facet-defining inequalities, it is able to find a separating cut whenever one exists. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e3518d086885d059078879a44f17a092
http://hdl.handle.net/11577/3207912
http://hdl.handle.net/11577/3207912
Publikováno v:
Journal of Circadian Rhythms, Vol 4, Iss 1, p 10 (2006)
Journal of Circadian Rhythms
Journal of Circadian Rhythms; Vol 4 (2006); Art. 10
Journal of Circadian Rhythms
Journal of Circadian Rhythms; Vol 4 (2006); Art. 10
Background Measurement of locomotor activity is a valuable tool for analysing factors influencing behaviour and for investigating brain function. Several methods have been described in the literature for measuring the amount of animal movement but mo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::67c362b1b67812814f8157556f12f38c
http://www.jcircadianrhythms.com/content/4/1/10
http://www.jcircadianrhythms.com/content/4/1/10