Pages that link to "Item:Q4018535"
From MaRDI portal
The following pages link to Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations (Q4018535):
Displayed 5 items.
- A packet filter placement problem with application to defense against spoofed denial of service attacks (Q853001) (← links)
- An adaptation of SH heuristic to the location set covering problem (Q1278140) (← links)
- Graph theoretic relaxations of set covering and set partitioning problems (Q1390264) (← links)
- Solving hard set covering problems (Q1924619) (← links)
- OPTIMAL SET-PARTITIONING BASED ON GROUP QUALITY LIKELIHOOD USING PARTITION-GROWING ALGORITHM (Q2874033) (← links)
