Pages that link to "Item:Q2995815"
From MaRDI portal
The following pages link to Upper bounds on the average number of iterations for some algorithms of solving the set packing problem (Q2995815):
Displaying 7 items.
- Estimation of the number of iterations in integer programming algorithms using the regular partitions method (Q463771) (← links)
- Using dual network bounds in algorithms for solving generalized set packing/partitioning problems (Q1814995) (← links)
- Application of implicit enumeration to solve the packing problem (Q1842413) (← links)
- Analysis of integer programming algorithms with \(L\)-partition and unimodular transformations (Q2261724) (← links)
- Average case analysis of the set packing problem (Q2786903) (← links)
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
- (Q3115267) (← links)