Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams (Q2806865)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams |
scientific article; zbMATH DE number 6582450
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams |
scientific article; zbMATH DE number 6582450 |
Statements
19 May 2016
0 references
branch and price
0 references
binary decision diagrams
0 references
graph coloring
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9086466
0 references
0.90337473
0 references
0.9019928
0 references
0 references
0.8964975
0 references
0.8713456
0 references
0.87040615
0 references
0.85362726
0 references
Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams (English)
0 references
