A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
From MaRDI portal
Cited in
(23)- An integral transformation for integer programming problems
- A polynomial algorithm for a one machine batching problem
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- On the effectivity of gradient methods for cutting stock problems
- Intersection cuts for single row corner relaxations
- A linear algorithm for integer programming in the plane
- Proportionate progress: A notion of fairness in resource allocation
- Cascading knapsack inequalities: reformulation of a crude oil distribution problem
- Description of 2-integer continuous knapsack polyhedra
- Polyhedral description of the integer single node flow set with constant bounds
- A two-dimensional strip cutting problem with sequencing constraint
- A finite-capacity production scheduling procedure for a Belgian steel company
- Lifted Euclidean inequalities for the integer single node flow set with upper bounds
- Efficient lattice width computation in arbitrary dimension
- Exact Solution of Systems of Linear Equations with Iterative Methods
- An algorithm for the 0/1 Knapsack problem
- Unbounded knapsack problems with arithmetic weight sequences
- Analysis of upper bounds for the pallet loading problem
- Lifting for the integer knapsack cover polyhedron
- Computing efficiently the lattice width in any dimension
- Non-standard approaches to integer programming
- Lifting two-integer knapsack inequalities
- An exact algorithm for large unbounded knapsack problems
This page was built for publication: A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4114964)
