Pages that link to "Item:Q2281727"
From MaRDI portal
The following pages link to A binary differential search algorithm for the 0-1 multidimensional knapsack problem (Q2281727):
Displaying 10 items.
- An approximate binary search algorithm for the multiple-choice knapsack problem (Q293371) (← links)
- Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm (Q342027) (← links)
- Two-dimensional knapsack-block packing problem (Q1984921) (← links)
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem (Q2195439) (← links)
- Maximizing lifetime of a wireless sensor network via joint optimizing sink placement and sensor-to-sink routing (Q2293981) (← links)
- Sparsity-promoting distributed charging control for plug-in electric vehicles over distribution networks (Q2295316) (← links)
- Stochastic project scheduling with hierarchical alternatives (Q2295321) (← links)
- A fully distributed ADMM-based dispatch approach for virtual power plant problems (Q2295330) (← links)
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem (Q2491319) (← links)
- Binary differential evolution algorithm with greedy packaging to solve high-dimensional knapsack problem (Q3180105) (← links)