Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
From MaRDI portal
Publication:5545156
DOI10.1287/opre.16.1.103zbMath0159.48803OpenAlexW2113442915MaRDI QIDQ5545156
Publication date: 1968
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.16.1.103
Related Items (17)
A number theoretic reformulation and decomposition method for integer programming ⋮ Heuristic algorithms based on column generation for an online product shipping problem ⋮ Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model ⋮ Computational experience with a group theoretic integer programming algorithm ⋮ Integer programming and convex analysis: Intersection cuts from outer polars ⋮ Generalized dynamic programming methods in integer programming ⋮ Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems ⋮ Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ A solution method for a knapsack problem and its variant ⋮ Shortest path algorithms for knapsack type problems ⋮ An extension of Hu's group minimization algorithm ⋮ A dynamic programming solution to integer linear programs ⋮ Testing integer knapsacks for feasibility ⋮ Faces of the Gomory polyhedron for cyclic groups ⋮ A relation between the knapsack and group knapsack problems ⋮ Alternative group relaxation of integer programming problems
This page was built for publication: Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
