Pages that link to "Item:Q1280199"
From MaRDI portal
The following pages link to A reformulation-linearization technique for solving discrete and continuous nonconvex problems (Q1280199):
Displaying 50 items.
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
- \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization (Q989898) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- On the polyhedral lift-and-project methods and the fractional stable set polytope (Q1015326) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions (Q1024827) (← links)
- Editorial: Reformulation techniques in mathematical programming (Q1025983) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
- Reformulation in mathematical programming: An application to quantum chemistry (Q1025997) (← links)
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998) (← links)
- Risk preference modeling with conditional average: An application to portfolio optimization (Q1026538) (← links)
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700) (← links)
- On optimal zero-preserving corrections for inconsistent linear systems (Q1041447) (← links)
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems (Q1329799) (← links)
- Evolution and state-of-the-art in integer programming (Q1593833) (← links)
- Matroid optimisation problems with nested non-linear monomials in the objective function (Q1646569) (← links)
- Binary extended formulations of polyhedral mixed-integer sets (Q1650775) (← links)
- Constrained optimization with integer and continuous variables using inexact restoration and projected gradients (Q1653960) (← links)
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness (Q1668789) (← links)
- Chebyshev model arithmetic for factorable functions (Q1675562) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Compact linearization for binary quadratic problems subject to assignment constraints (Q1728408) (← links)
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
- Two new reformulation convexification based hierarchies for 0-1 MIPs (Q1748458) (← links)
- The packing while traveling problem (Q1751654) (← links)
- An enhanced logarithmic method for signomial programming with discrete variables (Q1752141) (← links)
- A new lift-and-project operator (Q1752818) (← links)
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides (Q1753067) (← links)
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint (Q1753128) (← links)
- The minimum distance superset problem: formulations and algorithms (Q1756748) (← links)
- Maximum-entropy sampling and the Boolean quadric polytope (Q1756791) (← links)
- A computational study on the quadratic knapsack problem with multiple constraints (Q1761936) (← links)
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem (Q1761969) (← links)
- Globally solving nonconvex quadratic programming problems via completely positive programming (Q1762459) (← links)
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs (Q1771303) (← links)
- A rigorous global filtering algorithm for quadratic constraints (Q1774519) (← links)
- A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations (Q1785386) (← links)
- Difference of convex solution of quadratically constrained optimization problems. (Q1810525) (← links)
- A simple recipe for concise mixed 0-1 linearizations (Q1886797) (← links)
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
- On convex relaxations for quadratically constrained quadratic programming (Q1925792) (← links)
- A piecewise linearization framework for retail shelf space management models (Q1926922) (← links)
- A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms (Q1937084) (← links)
- Least squares for practitioners (Q1958841) (← links)
- Global minimization using an augmented Lagrangian method with variable lower-level constraints (Q1960193) (← links)
