LP relaxation of the two dimensional knapsack problem with box and GUB constraints

DOI10.1016/0377-2217(94)00285-1zbMath0915.90211OpenAlexW2029332305MaRDI QIDQ1266739

Nalinaksha Bhattacharyya, Nilotpal Chakravarti, Ansuman Bagchi

Publication date: 5 July 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00285-1

zbMATH Keywords

LP relaxationbox and generalized upper bound constraintsmultiple choice linear knapsack problemtwo-dimensional knapsack problem

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Production models (90B30)

Related Items (3)

Solving the linear multiple choice knapsack problem with two objectives: Profit and equity ⋮ Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem ⋮ A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem

Cites Work

• An O(n) algorithm for the multiple-choice knapsack linear program
• A o(n logn) algorithm for LP knapsacks with GUB constraints
• The Linear Multiple Choice Knapsack Problem
• THE MULTIPLE-CHOICE KNAPSACK PROBLEM
• The Multiple-Choice Knapsack Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: LP relaxation of the two dimensional knapsack problem with box and GUB constraints