Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints
From MaRDI portal
Publication:3951912
DOI10.1007/BF01585097zbMath0489.90069WikidataQ56324203 ScholiaQ56324203MaRDI QIDQ3951912
No author found.
Publication date: 1982
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585097
linear constraints; pre-processing; subgradient optimization; Lagrangian dual of discrete programming; Lagrangian subproblem; separable nonlinear objective function
65K05: Numerical mathematical programming methods
90C10: Integer programming
90C30: Nonlinear programming
Related Items
An efficient algorithm for multi-dimensional nonlinear knapsack problems, Complete collineations and blowing up determinantal ideals, Convergent Lagrangian and domain cut method for nonlinear knapsack problems, The geometry of complete linear maps, A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
Cites Work