Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
From MaRDI portal
Publication:1389081
DOI10.1023/A:1022622231801zbMath0911.90304MaRDI QIDQ1389081
Publication date: 11 June 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items (9)
On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming ⋮ Matheuristics: survey and synthesis ⋮ A trust region method for the solution of the surrogate dual in integer programming ⋮ On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints ⋮ Zero duality gap in surrogate constraint optimization: a concise review of models ⋮ Surrogate dual method for multi-dimensional nonlinear knapsack problems ⋮ On the complexity of surrogate and group relaxation for integer linear programs ⋮ Revisiting surrogate relaxation for the multidimensional knapsack problem ⋮ On generalized surrogate duality in mixed-integer nonlinear programming
Cites Work
- Unnamed Item
- Unnamed Item
- Two-direction subgradient method for non-differentiable optimization problems
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
- A result in surrogate duality for certain integer programming problems
- Variable target value subgradient method
- Surrogate Dual Multiplier Search Procedures in Integer Programming
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Some relationships between lagrangian and surrogate duality in integer programming
- Calculating surrogate constraints
- Surrogate Constraint Duality in Mathematical Programming
- Minimization of unsmooth functionals
- Surrogate Mathematical Programming
This page was built for publication: Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
