A trust region method for the solution of the surrogate dual in integer programming

DOI10.1007/s10957-014-0681-9zbMath1327.90127OpenAlexW2070073117MaRDI QIDQ896175

Angelos Tsoukalas, Andrew S. Eberhard, Natashia Boland

Publication date: 14 December 2015

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-014-0681-9

zbMATH Keywords

nonsmooth optimizationinteger programmingsurrogate dualtrust regions methods

Mathematics Subject Classification ID

Convex programming (90C25) Mixed integer programming (90C11) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (3)

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

Cites Work

• Unnamed Item
• Hard multidimensional multiple choice knapsack problems, an empirical study
• A trust region method for the solution of the surrogate dual in integer programming
• Surrogate duality in a branch-and-bound procedure for integer programming
• Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
• Decomposition algorithms for stochastic programming on a computational grid
• Surrogate Dual Multiplier Search Procedures in Integer Programming
• Some relationships between lagrangian and surrogate duality in integer programming
• Variational Analysis
• Generalized Bundle Methods
• Surrogate Mathematical Programming
• Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values

This page was built for publication: A trust region method for the solution of the surrogate dual in integer programming