Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
From MaRDI portal
Publication:1389081
DOI10.1023/A:1022622231801zbMATH Open0911.90304MaRDI QIDQ1389081FDOQ1389081
Authors: D. Massart 
Publication date: 11 June 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 4039640
- Surrogate duality in a branch-and-bound procedure for integer programming
- Surrogate gradient algorithm for Lagrangian relaxation
- A trust region method for the solution of the surrogate dual in integer programming
- scientific article; zbMATH DE number 3934777
Cites Work
- Minimization of unsmooth functionals
- Surrogate Mathematical Programming
- Surrogate Constraint Duality in Mathematical Programming
- Title not available (Why is that?)
- Variable target value subgradient method
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Some relationships between lagrangian and surrogate duality in integer programming
- Surrogate Dual Multiplier Search Procedures in Integer Programming
- Calculating surrogate constraints
- Two-direction subgradient method for non-differentiable optimization problems
- A result in surrogate duality for certain integer programming problems
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
- Title not available (Why is that?)
Cited In (16)
- On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints
- Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
- On generalized surrogate duality in mixed-integer nonlinear programming
- Surrogate duality in a branch-and-bound procedure for integer programming
- Surrogate dual method for multi-dimensional nonlinear knapsack problems
- Title not available (Why is that?)
- Matheuristics: survey and synthesis
- Title not available (Why is that?)
- Title not available (Why is that?)
- A trust region method for the solution of the surrogate dual in integer programming
- 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
- Zero duality gap in surrogate constraint optimization: a concise review of models
- AN IMPROVED SURROGATE CONSTRAINTS METHOD FOR SEPARABLE NONLINEAR INTEGER PROGRAMMING
- Zero duality gap in integer programming: \(P\)-norm surrogate constraint method
This page was built for publication: Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389081)
