A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations (Q3787788): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Michel Minoux / rank | |||
| Property / author | |||
| Property / author: Michel Minoux / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1441739641 / rank | |||
Normal rank | |||
Revision as of 21:58, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations |
scientific article |
Statements
A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations (English)
0 references
1987
0 references
column generation
0 references
very large size set covering
0 references
set partitioning
0 references
linear relaxations
0 references
generalized linear programming
0 references
plant location
0 references
forests
0 references
graph partitioning
0 references
chromatic index problem
0 references
clustering
0 references
k-center-sum
0 references
minimum weighted partitioning of a matroid
0 references
NP-complete
0 references
lower bounds
0 references
satellite communications
0 references
crew scheduling
0 references
