Pages that link to "Item:Q2140267"

The following pages link to A new class of hard problem instances for the 0-1 knapsack problem (Q2140267):

Displayed 3 items.

• 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)
• Features for the 0-1 knapsack problem based on inclusionwise maximal solutions (Q6168585) ‎ (← links)