A branch-and-price approach for the maximum weight independent set problem (Q5717716): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3160276 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Branch and Bound Methods for Mathematical Programming Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Geometric algorithms and combinatorial optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5687246 / rank | |||
Normal rank | |||
Revision as of 14:02, 11 June 2024
scientific article; zbMATH DE number 2245190
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-price approach for the maximum weight independent set problem |
scientific article; zbMATH DE number 2245190 |
Statements
A branch-and-price approach for the maximum weight independent set problem (English)
0 references
10 January 2006
0 references
branch and price
0 references
maximum weight-independent set problem
0 references
Dantzig-Wolfe decomposition
0 references
vertex partitioning
0 references
inheritly decomposable graphs
0 references
