The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool

DOI10.1007/BF00247210MaRDI QIDQ1357487zbMATH OpenOpenAlexFDO

Authors Arnaud Fréville, Gérard Plateau

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

zbMATH Keywords

implicit enumerationheuristic approachsurrogate dualitysize reductionbidimensional knapsack

Mathematics Subject Classification ID

Boolean programming (90C09)

Recommendations

• An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
• Heuristics for the 0-1 multidimensional knapsack problem
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
• Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem

Cited in

(16)

• A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances
• Shift-and-merge technique for the DP solution of the time-constrained backpacker problem
• Hybrid approaches for the two-scenario max-min knapsack problem
• A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
• Global optimization and multi knapsack: a percolation algorithm.
• An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
• A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
• The multidimensional 0-1 knapsack problem: an overview.
• Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
• Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
• Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
• A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
• An exact algorithm for the knapsack sharing problem
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem

Describes a project that uses

Uses Software

• MINTO

This page was built for publication: The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool

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