Pages that link to "Item:Q1110459"
From MaRDI portal
The following pages link to Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs (Q1110459):
Displaying 14 items.
- RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
- Convergence and computational analyses for some variable target value and subgradient deflection methods (Q853561) (← links)
- A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs (Q857822) (← links)
- Layering strategies for creating exploitable structure in linear and integer programs (Q1117840) (← links)
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems (Q1122488) (← links)
- A Langrangean heuristic for the \(p_ k\)-median dynamic location problem (Q1194737) (← links)
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem (Q1290717) (← links)
- Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions (Q1748494) (← links)
- A dual heuristic for mixed integer programming (Q1785392) (← links)
- Design of a distribution network using primal-dual decomposition (Q1793572) (← links)
- Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs (Q1935886) (← links)
- On Subadditive Duality for Conic Mixed-integer Programs (Q5234281) (← links)
- Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems (Q5506732) (← links)
- On using exterior penalty approaches for solving linear programming problems (Q5945315) (← links)
