An Algorithm for the Solution of 0-1 Loading Problems

DOI10.1287/OPRE.23.6.1110MaRDI QIDQ4077081zbMATH OpenOpenAlexFDO

Authors Giorgio P. Ingargiola, James F. Korsh

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)

Cited in

(10)

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

This page was built for publication: An Algorithm for the Solution of 0-1 Loading Problems

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