A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing (Q4018533): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1057/jors.1992.71 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066554880 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:36, 19 March 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
