Pages that link to "Item:Q4114964"

The following pages link to A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables (Q4114964):

Displaying 23 items.

• Lifted Euclidean inequalities for the integer single node flow set with upper bounds (Q322621) (← links)
• Unbounded knapsack problems with arithmetic weight sequences (Q545110) (← links)
• Computing efficiently the lattice width in any dimension (Q638564) (← links)
• Non-standard approaches to integer programming (Q697562) (← links)
• Lifting two-integer knapsack inequalities (Q868448) (← links)
• An exact algorithm for large unbounded knapsack problems (Q913659) (← links)
• An integral transformation for integer programming problems (Q1062628) (← links)
• A polynomial algorithm for a one machine batching problem (Q1197905) (← links)
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm (Q1245074) (← links)
• On the effectivity of gradient methods for cutting stock problems (Q1342431) (← links)
• Intersection cuts for single row corner relaxations (Q1621696) (← links)
• A linear algorithm for integer programming in the plane (Q1771307) (← links)
• Proportionate progress: A notion of fairness in resource allocation (Q1918992) (← links)
• Cascading knapsack inequalities: reformulation of a crude oil distribution problem (Q2393477) (← links)
• Description of 2-integer continuous knapsack polyhedra (Q2506817) (← links)
• Polyhedral description of the integer single node flow set with constant bounds (Q2583130) (← links)
• A two-dimensional strip cutting problem with sequencing constraint (Q2643967) (← links)
• A finite-capacity production scheduling procedure for a Belgian steel company (Q3012635) (← links)
• Efficient Lattice Width Computation in Arbitrary Dimension (Q3648771) (← links)
• Exact Solution of Systems of Linear Equations with Iterative Methods (Q3968378) (← links)
• An algorithm for the 0/1 Knapsack problem (Q4149230) (← links)
• Analysis of upper bounds for the pallet loading problem (Q5939589) (← links)
• Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)