Pages that link to "Item:Q1814995"
From MaRDI portal
The following pages link to Using dual network bounds in algorithms for solving generalized set packing/partitioning problems (Q1814995):
Displaying 4 items.
- The matching relaxation for a class of generalized set partitioning problems (Q1634772) (← links)
- Dual network bounds for integer programming problems of a special form (Q1842419) (← links)
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
- (Q4629365) (← links)