An algorithm for a class of loading problems

DOI10.1002/NAV.3800250209MaRDI QIDQ4190431zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

Boolean ProgrammingComputational StudyImplicid ProblemImplicit Enumeration AlgorithmLoading Problem

Mathematics Subject Classification ID

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

Cites work

• Fast algorithms for bin packing

Cited in

(10)

• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
• Decentralized decision‐making involving multiple criteria: a multiple knapsack formulation
• A heuristic routine for solving large loading problems
• Preventing redundant solutions in partial enumeration algorithms
• Relaxation techniques applied to some loading problems
• Analysis and modelling of a production line in a corrugated box factory
• Modeling and algorithmic development of a staff scheduling problem
• Lower bounds and algorithms for the 2-dimensional vector packing problem
• Lower bounds and reduction procedures for the bin packing problem

This page was built for publication: An algorithm for a class of loading problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4190431)