The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
From MaRDI portal
Publication:1357487
DOI10.1007/BF00247210zbMath0870.90084OpenAlexW1991565963MaRDI QIDQ1357487
Gérard Plateau, Arnaud Fréville
Publication date: 10 June 1997
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00247210
Related Items
A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances, Une approche hybride pour le sac à dos multidimensionnel en variables 0–1, Hybrid approaches for the two-scenario max-min knapsack problem, Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm, 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, Global optimization and multi knapsack: a percolation algorithm., The multidimensional 0-1 knapsack problem: an overview., A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem, Shift-and-merge technique for the DP solution of the time-constrained backpacker problem, An exact algorithm for the knapsack sharing problem, Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints, A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem, An efficient tabu search approach for the 0-1 multidimensional knapsack problem, The multidimensional 0-1 knapsack problem -- bounds and computational aspects
Uses Software
