Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs
From MaRDI portal
Publication:1935886
DOI10.1007/s11750-011-0199-3zbMath1267.90079OpenAlexW2053733287MaRDI QIDQ1935886
J. Cole Smith, Hanif D. Sherali
Publication date: 20 February 2013
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-011-0199-3
valid inequalitiesmixed-integer programmingreformulation-linearization techniquedelayed relax-and-cut approachdynamic Lagrangian dual
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- On embedding the volume algorithm in a variable target value method.
- Non delayed relax-and-cut algorithms
- 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
- Proximity control in bundle methods for convex nondifferentiable minimization
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
- Efficient cuts in Lagrangean `relax-and-cut' schemes
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- The volume algorithm: Producing primal solutions with a subgradient method
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Ergodic, primal convergence in dual subgradient schemes for convex programming
- A variable target value method for nondifferentiable optimization
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
- Enhancing Lagrangian Dual Optimization for Linear Programs by Obviating Nondifferentiability
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- A Survey of Lagrangean Techniques for Discrete Optimization
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Validation of subgradient optimization
- Minimization of unsmooth functionals
