Network Relaxations and Lower Bounds for Multiple Choice Problems (Q3967363): 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: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/03155986.1982.11731875 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2405880920 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:07, 20 March 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
