A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing (Q4018533)
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: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing |
scientific article |
Statements
A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing (English)
0 references
16 January 1993
0 references
heuristics
0 references
cutting plane/branch-and-bound algorithm
0 references
node packing
0 references
