The knapsack problem with disjoint multiple-choice constraints

DOI10.1002/nav.3220390206zbMath0764.90056OpenAlexW2020305217MaRDI QIDQ3993988

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (1)

Computational comparison on the partitioning strategies in multiple choice integer programming

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