Network Relaxations and Lower Bounds for Multiple Choice Problems (Q3967363): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:17, 6 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Network Relaxations and Lower Bounds for Multiple Choice Problems |
scientific article |
Statements
Network Relaxations and Lower Bounds for Multiple Choice Problems (English)
0 references
1982
0 references
lower bounds
0 references
network relaxations
0 references
penalty calculations
0 references
multiple choice constraints
0 references
generalized upper bounding
0 references
numerical efficiency
0 references
