scientific article; zbMATH DE number 6180864
From MaRDI portal
Publication:5299147
zbMath1266.90120MaRDI QIDQ5299147
K. Kannan, S. Raja Balachandar
Publication date: 25 June 2013
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (3)
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® ⋮ 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
This page was built for publication:
