Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound

DOI10.1287/opre.27.3.548zbMath0406.90053OpenAlexW2151861549MaRDI 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

zbMATH Keywords

Integer ProgrammingNetwork ProgrammingBranch and Bound AlgorithmImplicit EnumerationCyclic Network AlgorithmExpanded NetworkGroup Knapsack ProblemGroup Theoretic Approach

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10)

Related Items (6)

On the Bellman's principle of optimality ⋮ A new enumeration scheme for the knapsack problem ⋮ On Some Special Network Flow Problems: The Shortest Path Tour Problems ⋮ Complexity analysis and optimization of the shortest path tour problem ⋮ Branching from the largest upper bound. Folklore and facts ⋮ Testing integer knapsacks for feasibility

This page was built for publication: Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound