A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem (Q5643805): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q57253946, #quickstatements; #temporary_batch_1711055989931 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/mnsc.18.7.401 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1984407615 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57253946 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:20, 22 March 2024
scientific article; zbMATH DE number 3371842
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem |
scientific article; zbMATH DE number 3371842 |
Statements
A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem (English)
0 references
1972
0 references
