An Algorithm for the Solution of 0-1 Loading Problems

DOI10.1287/opre.23.6.1110zbMath0315.90054OpenAlexW2076481663MaRDI QIDQ4077081

James F. Korsh, Giorgio P. Ingargiola

Publication date: 1975

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.23.6.1110

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items

A heuristic routine for solving large loading problems, Polynomial time approximation schemes for class-constrained packing problems, A Branch-and-Price Algorithm for the Multiple Knapsack Problem, Solution of the zero-one multiple knapsack problem, A bound and bound algorithm for the zero-one multiple knapsack problem, An effective structured approach to finding optimal partitions of networks, Variablenfixierungen in gemischt-ganzzahligen linearen 0-1-Optimierungsaufgaben, Mathematical models and decomposition methods for the multiple knapsack problem, A branch-and-bound algorithm for hard multiple knapsack problems, Heuristic methods and applications: A categorized survey