Pages that link to "Item:Q3786281"
From MaRDI portal
The following pages link to Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems (Q3786281):
Displaying 7 items.
- Surrogate constraint normalization for the set covering problem (Q976352) (← links)
- A surrogate heuristic for set covering problems (Q1342046) (← links)
- Dual-based heuristics for a hierarchical covering location problem (Q1869894) (← links)
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes (Q1972019) (← links)
- Zero duality gap in surrogate constraint optimization: a concise review of models (Q2255935) (← links)
- A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
- Searching for optimal integer solutions to set partitioning problems using column generation (Q5416769) (← links)
