A cross entropy algorithm for the Knapsack problem with setups

DOI10.1016/J.COR.2006.02.028MaRDI QIDQ2384601zbMATH OpenOpenAlexFDO

Authors 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

Combinatorial optimizationcross entropydynamic programmingKnapsack problemmetaheuristicsscheduling

Mathematics Subject Classification ID

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

Recommendations

• A dynamic programming algorithm for the knapsack problem with setup
• Exact and heuristic solution approaches for the mixed integer setup knapsack problem
• Exact approaches for the knapsack problem with setups
• Exact Algorithms For The Setup Knapsack Problem
• Knapsack problems with setups

Cites work

• A cutting plane approach to capacitated lot-sizing with start-up costs
• A minimal algorithm for the multiple-choice knapsack problem
• A tutorial on the cross-entropy method
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• Knapsack problems with setups
• Modeling and analyzing multiple station baggage screening security system performance
• On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
• On the polyhedral structure of a multi-item production planning model with setup times
• Polyhedra for lot-sizing with Wagner-Whitin costs
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Valid inequalities and separation for capacitated economic lot sizing

Cited in

(8)

• A cross entropy approach to design of reliable networks
• 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
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• Generalized quadratic multiple knapsack problem and two solution approaches
• Scenario-based stochastic model and efficient cross-entropy algorithm for the risk-budgeting problem
• A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times

Describes a project that uses

Uses Software

• Knapsack

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

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