On a generalized bin-packing problem

DOI10.1002/nav.3800290112zbMath0539.90075OpenAlexW2076362620MaRDI QIDQ3328283

No author found.

Publication date: 1982

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800290112

zbMATH Keywords

branch-and-boundcomputational experiencebin-packingLagrangian relaxationsbin costsbin-dependent chip weightsbin-dependent penalties

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Boolean programming (90C09)

Related Items (4)

Relaxation techniques applied to some loading problems ⋮ Decentralized decision‐making involving multiple criteria: a multiple knapsack formulation ⋮ Lower bounds for a bin packing problem with linear usage cost ⋮ Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing

Cites Work

• Fast algorithms for bin packing
• A heuristic routine for solving large loading problems
• Unnamed Item

This page was built for publication: On a generalized bin-packing problem