Topic
Relaxation (approximation)
About: Relaxation (approximation) is a research topic. Over the lifetime, 9461 publications have been published within this topic receiving 209635 citations.
Papers published on a yearly basis
1 / 2
Papers
TL;DR: The development of the cross decomposition method captures profound relationships between primal and dual decomposition, and shows that the more constraints can be included in the Langrangean relaxation, the fewer the Benders cuts one may expect to need.
Abstract: Many methods for solving mixed integer programming problems are based either on primal or on dual decomposition, which yield, respectively, a Benders decomposition algorithm and an implicit enumeration algorithm with bounds computed via Lagrangean relaxation. These methods exploit either the primal or the dual structure of the problem. We propose a new approach, cross decomposition, which allows exploiting simultaneously both structures. The development of the cross decomposition method captures profound relationships between primal and dual decomposition. It is shown that the more constraints can be included in the Langrangean relaxation (provided the duality gap remains zero), the fewer the Benders cuts one may expect to need. If the linear programming relaxation has no duality gap, only one Benders cut is needed to verify optimality.
184 citations
TL;DR: Dolbeault et al. as discussed by the authors proposed a method for proving the hypocoercivity associated to a kinetic equation involving a linear time relaxation operator, which is based on the construction of an adapted Lyapunov functional satisfying a Gronwall-type inequality.
184 citations
TL;DR: In this article, a novel approach for the development of a model for Li-ion batteries with the potential for application in on-board diagnostic is introduced, which has the advantages of scalability and automatable parameterization as well as feasibility regarding an implementation on microcontrollers.
184 citations
TL;DR: A Lagrangean relaxation is proposed to solve the facility location problem, together with a heuristic procedure that constructs feasible solutions of the original problem from the solutions at the lower bounds obtained by the relaxed problems.
183 citations
TL;DR: A quasi-Newton coupling algorithm with an approximation for the inverse of the Jacobian (IQN-ILS) has been developed and compared with a monolithic solver in previous work as discussed by the authors.
183 citations
Performance Metrics
| Year | Papers |
|---|---|
| 2022 | 20 |
| 2021 | 574 |
| 2020 | 539 |
| 2019 | 517 |
| 2018 | 500 |
| 2017 | 513 |