Pages that link to "Item:Q2514810"
From MaRDI portal
The following pages link to A fast approximation algorithm for solving the complete set packing problem (Q2514810):
Displaying 5 items.
- Alternative formulations for the set packing problem and their application to the winner determination problem (Q367639) (← links)
- A faster parameterized algorithm for set packing (Q1041711) (← links)
- An evolutionary algorithm based hyper-heuristic framework for the set packing problem (Q2656742) (← links)
- Upper bounds on the average number of iterations for some algorithms of solving the set packing problem (Q2995815) (← links)
- Fast First-Order Algorithms for Packing–Covering Semidefinite Programs (Q3454972) (← links)