Pages that link to "Item:Q1569935"
From MaRDI portal
The following pages link to New trends in exact algorithms for the \(0-1\) knapsack problem (Q1569935):
Displaying 10 items.
- Approximate and exact algorithms for the fixed-charge knapsack problem (Q2572244) (← links)
- A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances (Q2629710) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence (Q2855721) (← links)
- Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study (Q2883592) (← links)
- Reliable Dynamic Packet Scheduling over Lossy Real-Time Wireless Networks (Q5089111) (← links)
- Random knapsack in expected polynomial time (Q5917572) (← links)
- A time-dependent multiple criteria single-machine scheduling problem (Q5954823) (← links)
- Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties (Q6081604) (← links)
- Hybrid genetic algorithm for undirected traveling salesman problems with profits (Q6139377) (← links)
