A heuristic routine for solving large loading problems
type: Item
instance of: scholarly article
title: A heuristic routine for solving large loading problems
zbMATH Open document ID: 0497.90044
author: John C. Fisk
author: Ming S. Hung
published in: Naval Research Logistics Quarterly
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C08
zbMATH DE Number: 3784632
zbMATH Keywords: loading problem
zbMATH Keywords: optimal allocation of n objects
zbMATH Keywords: m boxes
zbMATH Keywords: variable item weights
zbMATH Keywords: heuristic procedure
zbMATH Keywords: knapsack problem
zbMATH Keywords: variable box sizes
MaRDI profile type: Publication
full work available at URL: nav.3800260409
OpenAlex ID: W1509898203
cites work: Merging and Sorting Applied to the Zero-One Knapsack Problem
cites work: An Additive Algorithm for Solving Linear Programs with Zero-One Variables
cites work: Discrete Programming by the Filter Method
cites work: The Loading Problem
cites work: An Improved Implicit Enumeration Approach for Integer Programming
cites work: Surrogate Constraints
cites work: Surrogate Constraint Duality in Mathematical Programming
cites work: An algorithm for a class of loading problems
cites work: An algorithm for 0-1 multiple-knapsack problems
cites work: An Algorithm for the Solution of 0-1 Loading Problems
cites work: An upper bound for the zero-one knapsack problem and a branch and bound algorithm
DOI: 10.1002/NAV.3800260409
description: scientific article