RLT: A unified approach for discrete and continuous nonconvex optimization
From MaRDI portal
Publication:537611
DOI10.1007/s10479-006-0107-7zbMath1213.90029OpenAlexW2070963419MaRDI QIDQ537611
Publication date: 20 May 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-006-0107-7
Integer programming (90C10) History of mathematics in the 20th century (01A60) History of operations research and mathematical programming (90-03)
Related Items
Computational approaches for mixed integer optimal control problems with indicator constraints, On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon, Facets of a mixed-integer bilinear covering set with bounds on variables, Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons, Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
Uses Software
Cites Work
- Unnamed Item
- Enhancing RLT relaxations via a new class of semidefinite cuts
- Mixed-integer bilinear programming problems
- Convergence and computational analyses for some variable target value and subgradient deflection methods
- A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
- Optimization with disjunctive constraints
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- A pseudo-global optimization approach with application to the design of containerships
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- BARON: A general purpose global optimization software package
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Decomposition Algorithm for a Discrete Location-Allocation Problem
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- On Solving Polynomial, Factorable, and Black-Box Optimization Problems Using the RLT Methodology
- Global optimization of nonconvex factorable programming problems
