Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
From MaRDI portal
(Redirected from Publication:1389081)
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
- scientific article; zbMATH DE number 4072712 (Why is no real title available?)
- scientific article; zbMATH DE number 3557512 (Why is no real title available?)
- A result in surrogate duality for certain integer programming problems
- Calculating surrogate constraints
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Minimization of unsmooth functionals
- Some relationships between lagrangian and surrogate duality in integer programming
- Surrogate Constraint Duality in Mathematical Programming
- Surrogate Dual Multiplier Search Procedures in Integer Programming
- Surrogate Mathematical Programming
- Two-direction subgradient method for non-differentiable optimization problems
- Variable target value subgradient method
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
- scientific article; zbMATH DE number 4039640 (Why is no real title available?)
- Matheuristics: survey and synthesis
- scientific article; zbMATH DE number 3934777 (Why is no real title available?)
- scientific article; zbMATH DE number 4126606 (Why is no real title available?)
- 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)
