Pages that link to "Item:Q1096544"
From MaRDI portal
The following pages link to Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms (Q1096544):
Displaying 5 items.
- On a cardinality constrained linear programming knapsack problem (Q753684) (← links)
- The matching relaxation for a class of generalized set partitioning problems (Q1634772) (← links)
- Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem (Q1705774) (← links)
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
- Lagrangian relaxation and pegging test for the clique partitioning problem (Q2256778) (← links)