least-cost route

  • 1Least-cost routing — In international voice telecommunications, least cost routing (LCR) is the process that provides customers with cheap telephone calls. Within a telecoms carrier, an LCR team will be choosing routes from between twenty to over one hundred… …

    Wikipedia

  • 2Least-Cost Routing — Le Least Cost Routing (LCR) ou Routage au moindre coût est un système permettant de sélectionner parmi plusieurs opérateurs télécom, celui proposant la meilleure route, pour chaque appel, en fonction de plusieurs critères tel que le coût de la… …

    Wikipédia en Français

  • 3least cost routing —    (LCR)    A method of automatically selecting the least costly facility for transmitting a call. Synonym: MERS (most economical route selection); route optimization; ARS (automatic route selection); flexible route selection …

    IT glossary of terms, acronyms and abbreviations

  • 4route optimization —    See least cost routing …

    IT glossary of terms, acronyms and abbreviations

  • 5Route Trident — (known locally as the New or Big Road)[1] was built by the British Army s Royal Engineers in Helmand Province, Afghanistan. The construction of the road was codenamed Operation Lar Jarowel by the Ministry of Defence.[2] Route Trident replaced an… …

    Wikipedia

  • 6Route assignment — Route assignment, route choice, or traffic assignment concerns the selection of routes (alternative called paths) between origins and destinations in transportation networks. It is the fourth step in the conventional transportation forecasting… …

    Wikipedia

  • 7automatic route selection — (ARS)    Computerized or mechanically controlled selection and routing of outgoing calls over the least cost route for the type of call initiated …

    IT glossary of terms, acronyms and abbreviations

  • 8New Jersey Route 17 — Route 17 Route information Maintained by NJD …

    Wikipedia

  • 9Route inspection problem — In graph theory, a branch of mathematics, the Chinese postman problem (CPP), postman tour or route inspection problem is to find a shortest closed path or circuit that visits every edge of a (connected) undirected graph. When the graph has an… …

    Wikipedia

  • 10Rhode Island Route 4 — Route 4 Colonel Rodman Highway …

    Wikipedia