Pages that link to "Item:Q5385039"
From MaRDI portal
The following pages link to RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385039):
Displaying 13 items.
- An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
- The robust set covering problem with interval data (Q367647) (← links)
- A hybrid heuristic for the set covering problem (Q373244) (← links)
- Optimizing word set coverage for multi-event summarization (Q887893) (← links)
- An electromagnetism metaheuristic for the unicost set covering problem (Q976443) (← links)
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints (Q1652583) (← links)
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015) (← links)
- A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem (Q1991205) (← links)
- Optimization of the number and arrangement of circles of two radii for forming a \(k\)-covering of a bounded set (Q2332657) (← links)
- A set covering approach for multi-depot train driver scheduling (Q2343986) (← links)
- The set covering problem revisited: an empirical study of the value of dual information (Q2514674) (← links)
- A Nested Decomposition Approach for a Large Scale Set Covering Problem: A Model with a Variety of Applications in Industry 4.0 (Q3299233) (← links)
- A set covering based matheuristic for a real‐world city logistics problem (Q5246831) (← links)
