Pages that link to "Item:Q2140267"
From MaRDI portal
The following pages link to A new class of hard problem instances for the 0-1 knapsack problem (Q2140267):
Displaying 10 items.
- Evolution of new algorithms for the binary knapsack problem (Q2003461) (← links)
- Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis (Q2027074) (← links)
- Evolving test instances of the Hamiltonian completion problem (Q2108108) (← links)
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (Q2108169) (← links)
- Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems (Q4393124) (← links)
- (Q4458134) (← links)
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions (Q6168585) (← links)
- Instance space analysis for 2D bin packing mathematical models (Q6554643) (← links)
- Expectation analysis for bounding solutions of the 0-1 knapsack problem (Q6636466) (← links)
- A practical approach for dealing with hard knapsack problems using general-purpose integer programming software (Q6659825) (← links)
