On single courier problem (Q941049): Difference between revisions

From MaRDI portal
← Older editNewer edit →
Import240304020342 (talk | contribs)
4,416,906 edits
Set profile property.
ReferenceBot (talk | contribs)
Bots
1,903,984 edits
‎Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-008-0079-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076541251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling Salesman Problem: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for NP-hard geometric optimization problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete optimization in public rail transport / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4319638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4211186 / rank
 
Normal rank

Revision as of 15:07, 28 June 2024

scientific article
Language Label Description Also known as
English
On single courier problem
scientific article

    Statements

    title
    On single courier problem (English)
    0 references
    publication date
    4 September 2008
    0 references
    zbMATH Keywords
    courier problems
    0 references
    single courier problem
    0 references
    traveling salesman problem
    0 references
    optimality principle
    0 references

    Identifiers

    zbMATH DE Number
    5320859
    0 references
    OpenAlex ID
    W2076541251
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q941049&oldid=35070356"
    Powered by MediaWiki