scientific article; zbMATH DE number 6180864

MaRDI QIDQ5299147zbMATH OpenFDO

Authors S. Raja Balachandar, K. Kannan

Publication date 25 June 2013

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cited in

(3)

• Robust efficiency measures for linear knapsack problem variants
• When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners
• A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX^®

This page was built for publication:

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