scientific article; zbMATH DE number 3581927

zbMath0373.90070MaRDI QIDQ4152351

L. F. Gelders, L. G. Chalmet

Publication date: 1977

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Search theory (90B40)

Related Items (8)

A new Lagrangian relaxation approach to the generalized assignment problem ⋮ A Survey of the Generalized Assignment Problem and Its Applications ⋮ Effective algorithm and heuristic for the generalized assignment problem. ⋮ Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach ⋮ A Lagrangean dual-based solution method for a special linear programming problem ⋮ Zero-one integer programs with few contraints - lower bounding theory ⋮ Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality ⋮ A set partitioning heuristic for the generalized assignment problem

This page was built for publication: