Pages that link to "Item:Q1390264"

The following pages link to Graph theoretic relaxations of set covering and set partitioning problems (Q1390264):

Displaying 7 items.

• A dual ascent procedure for the set partitioning problem (Q955334) (← links)
• A concurrent processing framework for the set partitioning problem (Q1603333) (← links)
• The matching relaxation for a class of generalized set partitioning problems (Q1634772) (← links)
• A column generation approach to the coalition formation problem in multi-agent systems (Q1885967) (← links)
• OPTIMAL SET-PARTITIONING BASED ON GROUP QUALITY LIKELIHOOD USING PARTITION-GROWING ALGORITHM (Q2874033) (← links)
• Automatic production planning of press brakes for sheet metal bending (Q3432666) (← links)
• Genetic clustering algorithms. (Q5952444) (← links)