A cross entropy algorithm for the Knapsack problem with setups

DOI10.1016/j.cor.2006.02.028zbMath1149.90391OpenAlexW2099865739MaRDI QIDQ2384601

Yanyan Li

Publication date: 10 October 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.02.028

zbMATH Keywords

schedulingdynamic programmingmetaheuristicsCombinatorial optimizationKnapsack problemcross entropy

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (7)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Generalized quadratic multiple knapsack problem and two solution approaches ⋮ An exact approach for the 0-1 knapsack problem with setups ⋮ A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem ⋮ Planning of complex supply chains: a performance comparison of three meta-heuristic algorithms ⋮ A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times ⋮ A cross entropy approach to design of reliable networks

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Knapsack problems with setups
• Valid inequalities and separation for capacitated economic lot sizing
• A cutting plane approach to capacitated lot-sizing with start-up costs
• A minimal algorithm for the multiple-choice knapsack problem
• On the polyhedral structure of a multi-item production planning model with setup times
• On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
• Polyhedra for lot-sizing with Wagner-Whitin costs
• A tutorial on the cross-entropy method
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Modeling and analyzing multiple station baggage screening security system performance

This page was built for publication: A cross entropy algorithm for the Knapsack problem with setups