An algorithm for a class of loading problems
From MaRDI portal
Publication:4190431
DOI10.1002/nav.3800250209zbMath0404.90057OpenAlexW1998063340MaRDI QIDQ4190431
Ming S. Hung, J. Randall Brown
Publication date: 1978
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800250209
Related Items
A heuristic routine for solving large loading problems ⋮ BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem ⋮ Relaxation techniques applied to some loading problems ⋮ Lower bounds and reduction procedures for the bin packing problem ⋮ Decentralized decision‐making involving multiple criteria: a multiple knapsack formulation ⋮ Modeling and algorithmic development of a staff scheduling problem ⋮ Analysis and modelling of a production line in a corrugated box factory ⋮ Lower bounds and algorithms for the 2-dimensional vector packing problem ⋮ Preventing redundant solutions in partial enumeration algorithms ⋮ Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
Cites Work
This page was built for publication: An algorithm for a class of loading problems
