Pages that link to "Item:Q1390264"
From MaRDI portal
The following pages link to Graph theoretic relaxations of set covering and set partitioning problems (Q1390264):
Displaying 14 items.
- A dual ascent procedure for the set partitioning problem (Q955334) (← links)
- Set packing relaxations of some integer programs (Q1587935) (← 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)
- A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← 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)
- Automatic production planning of press brakes for sheet metal bending (Q3432666) (← links)
- (Q3585507) (← links)
- A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations (Q3787788) (← links)
- Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations (Q4018535) (← links)
- (Q4422090) (← links)
- Genetic clustering algorithms. (Q5952444) (← links)
