Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound
From MaRDI portal
Publication:4193265
DOI10.1287/opre.27.3.548zbMath0406.90053MaRDI QIDQ4193265
Eric V. Denardo, Bennett L. Fox
Publication date: 1979
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.27.3.548
Integer Programming; Network Programming; Branch and Bound Algorithm; Implicit Enumeration; Cyclic Network Algorithm; Expanded Network; Group Knapsack Problem; Group Theoretic Approach
90C35: Programming involving graphs or networks
05C35: Extremal problems in graph theory
90C10: Integer programming
Related Items
A new enumeration scheme for the knapsack problem, Branching from the largest upper bound. Folklore and facts, Testing integer knapsacks for feasibility