The knapsack problem with disjoint multiple-choice constraints

DOI10.1002/NAV.3220390206zbMATH Open0764.90056OpenAlexW2020305217MaRDI QIDQ3993988FDOQ3993988

Authors: Vijay Aggarwal, Narsingh Deo, Dilip Sarkar 

Publication date: 13 August 1992

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3220390206

Recommendations

• A minimal algorithm for the multiple-choice knapsack problem
• A branch and bound algorithm for solving the multiple-choice knapsack problem
• scientific article; zbMATH DE number 3906236
• The linear multiple choice knapsack problem
• scientific article; zbMATH DE number 3889280

zbMATH Keywords

branch-and-boundtwo-stage algorithmLagrangean dualmultiple-choice knapsack problemGUB constraints

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Boolean programming (90C09)

Cited In (8)

• The linking set problem: a polynomial special case of the multiple-choice knapsack problem
• Computational comparison on the partitioning strategies in multiple choice integer programming
• The multiple-choice multi-period knapsack problem
• The constrained compartmentalised knapsack problem
• The linear multiple choice knapsack problem with equity constraints
• Title not available (Why is that?)
• Multi-constrained matroidal knapsack problems
• A dynamic programming algorithm for multiple-choice constraints

This page was built for publication: The knapsack problem with disjoint multiple-choice constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3993988)