Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Pierre Bonami"'
Publikováno v:
Operations Research. 70:3303-3320
Despite modern solvers being able to tackle mixed-integer quadratic programming problems (MIQPs) for several years, the theoretical and computational implications of the employed resolution techniques are not fully grasped yet. An interesting questio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a7c6daa999125efd491d065347a2784
https://doi.org/10.1287/opre.2022.2267
https://doi.org/10.1287/opre.2022.2267
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783030457709
IPCO
IPCO
We describe the automatic Benders decomposition implemented in the commercial solver IBM CPLEX. We propose several improvements to the state-of-the-art along two lines: making a numerically robust method able to deal with the general case and improvi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a378cc2262b66797e427e9adf47df797
https://doi.org/10.1007/978-3-030-45771-6_7
https://doi.org/10.1007/978-3-030-45771-6_7
Publikováno v:
Mathematical Programming Computation. 10:333-382
We present effective linear programming based computational techniques for solving nonconvex quadratic programs with box constraints (BoxQP). We first observe that known cutting planes obtained from the Boolean Quadric Polytope (BQP) are computationa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2ba1574d7ec177a837681b88da32376
https://doi.org/10.1007/s12532-018-0133-x
https://doi.org/10.1007/s12532-018-0133-x
We propose new cutting planes for strengthening the linear relaxations that appear in the solution of nonconvex quadratic problems with linear constraints. By a famous result of Motzkin and Straus, these problems are connected to the clique number of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ec52e5446bf7a1efdae29719bc868629
http://hdl.handle.net/11585/815420
http://hdl.handle.net/11585/815420
Publikováno v:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783319930305
CPAIOR
CPAIOR
Within state-of-the-art solvers such as IBM-CPLEX, the ability to solve both convex and nonconvex Mixed-Integer Quadratic Programming (MIQP) problems to proven optimality goes back few years, yet presents unclear aspects. We are interested in underst
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ed06cd9f111af65a3a54302a8ff7a8a
https://doi.org/10.1007/978-3-319-93031-2_43
https://doi.org/10.1007/978-3-319-93031-2_43
Autor:
Pierre Bonami, François Margot
Publikováno v:
Mathematical Programming. 154:197-223
For a mixed integer linear program where all integer variables are bounded, we study a reformulation introduced by Roy that maps general integer variables to a collection of binary variables. We study theoretical properties and empirical strength of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::13a243ef18fe86f65a518e52da1606e3
https://doi.org/10.1007/s10107-015-0924-z
https://doi.org/10.1007/s10107-015-0924-z
Publikováno v:
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2009, NEW YORK, NY, United States. pp.1220
Mathematical Programming, Series A
Mathematical Programming, Series A, Springer, 2009, pp.On line first. ⟨10.1007/s10107-009-0281-x⟩
Mathematical Programming, Series A, 2009, pp.On line first. ⟨10.1007/s10107-009-0281-x⟩
Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2009, NEW YORK, NY, United States. pp.1220
Mathematical Programming, Series A
Mathematical Programming, Series A, Springer, 2009, pp.On line first. ⟨10.1007/s10107-009-0281-x⟩
Mathematical Programming, Series A, 2009, pp.On line first. ⟨10.1007/s10107-009-0281-x⟩
International audience; Integer programs defined by two equations with two free integer variables and nonnegative continuous variables have three types of nontrivial facets: split, triangle or quadrilateral inequalities. In this paper, we compare the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::af520d9545c89b617d564953c1b74f2f
http://arxiv.org/abs/1701.06536
http://arxiv.org/abs/1701.06536
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783319592497
IPCO
IPCO
In this paper, we discuss an extension of split cuts that is based on widening the underlying disjunctions. That the formula for deriving intersection cuts based on splits can be adapted to this case has been known for a decade now. For the first tim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a6ad8dc3e4fc9f3568797a2d77214164
https://doi.org/10.1007/978-3-319-59250-3_9
https://doi.org/10.1007/978-3-319-59250-3_9
Publikováno v:
INFORMS Journal on Computing. 26:31-44
A common structure in convex mixed-integer nonlinear programs (MINLPs) is separable nonlinear functions. In the presence of such structures, we propose three improvements to the outer approximation algorithms. The first improvement is a simple extend
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7076e15fb926096b0be9338926e296cb
https://doi.org/10.1287/ijoc.1120.0545
https://doi.org/10.1287/ijoc.1120.0545
Publikováno v:
Journal of Optimization Theory and Applications. 163:80-104
In this work, the energy-optimal motion planning problem for planar robot manipulators with two revolute joints is studied, in which the end-effector of the robot manipulator is constrained to pass through a set of waypoints, whose sequence is not pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fead484db75f432c9f4dc764d609a2bb
https://doi.org/10.1007/s10957-013-0516-0
https://doi.org/10.1007/s10957-013-0516-0