Pages that link to "Item:Q4018535"

The following pages link to Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations (Q4018535):

Displaying 14 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)
• Relation between set covering and set partitioning problems (Q1369003) (← links)
• Graph theoretic relaxations of set covering and set partitioning problems (Q1390264) (← links)
• Solving hard set covering problems (Q1924619) (← links)
• Relation between set partitioning and set covering problems with quadratic fractional objective functions (Q1929500) (← links)
• A novel decomposition approach to set covering problems by exploiting special structures (Q2113818) (← links)
• A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
• Solution of problems of minimal set partition and set covering (Q2813442) (← links)
• Optimal set-partitioning based on group quality likelihood using partition-growing algorithm (Q2874033) (← links)
• Innovative cost allocation strategies for the shortest route relaxation of the set covering problem (Q2907709) (← links)
• (Q3487139) (← links)
• (Q3585507) (← links)
• A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations (Q3787788) (← links)