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
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q671938
Created claim: Wikidata QID (P12): Q57253946, #quickstatements; #temporary_batch_1711055989931
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Eugene L. Lawler / rank
 
Normal rank
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.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 / namelinks / mardi / name
 

Latest revision as of 03: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
    0 references
    1972
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references