scientific article; zbMATH DE number 2156314

MaRDI QIDQ4668779zbMATH OpenFDO

Authors Takeo Yamada

Publication date 15 April 2005

zbMATH Keywords

implicit enumerationmultiple knapsack problemmax-min optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Minimax problems in mathematical programming (90C47)

Recommendations

• An exact algorithm for large multiple knapsack problems
• On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
• Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
• Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem
• Publication:3471851

Cited in

(8)

• Bridging game theory and the knapsack problem: a theoretical formulation
• An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem
• An exact algorithm for large multiple knapsack problems
• The implicit hitting set approach to solve combinatorial optimization problems with an application to multigenome alignment
• Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem
• Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
• Multiple subset sum with inclusive assignment set restrictions
• Heuristics for determining the number of warehouses for storing non-compatible products

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 Q4668779)