A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing (Q4018533): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:55, 6 February 2024
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
