A heuristic routine for solving large loading problems

DOI10.1002/nav.3800260409zbMath0497.90044OpenAlexW1509898203MaRDI QIDQ3962774

John C. Fisk, Ming S. Hung

Publication date: 1979

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

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

zbMATH Keywords

knapsack problemheuristic procedureloading problemm boxesoptimal allocation of n objectsvariable box sizesvariable item weights

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Boolean programming (90C09)

Related Items

Polynomial time approximation schemes for class-constrained packing problems ⋮ A Branch-and-Price Algorithm for the Multiple Knapsack Problem ⋮ Matheuristics: survey and synthesis ⋮ Heuristic algorithms for the multiple knapsack problem ⋮ A modular algorithm for an extended vehicle scheduling problem ⋮ Mathematical models and decomposition methods for the multiple knapsack problem ⋮ On a generalized bin-packing problem

Cites Work

• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• Surrogate Constraint Duality in Mathematical Programming
• An Algorithm for the Solution of 0-1 Loading Problems
• Merging and Sorting Applied to the Zero-One Knapsack Problem
• An algorithm for 0-1 multiple-knapsack problems
• An algorithm for a class of loading problems
• Discrete Programming by the Filter Method
• Surrogate Constraints
• An Improved Implicit Enumeration Approach for Integer Programming
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• The Loading Problem

This page was built for publication: A heuristic routine for solving large loading problems