Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("SHORTEST PATH")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 3116

  • Page / 125
Export

Selection :

  • and

A NOTE ON THE PROBLEM OF UPDATING SHORTEST PATHSFUJISHIGE S.1981; NETWORKS; ISSN 0028-3045; USA; DA. 1981; VOL. 11; NO 3; PP. 317-319; BIBL. 6 REF.Article

A HYBRID ALGORITHM FOR THE SHORTEST PATH BETWEEN TWO NODES IN THE PRESENCE OF FEW NEGATIVE ARCSYAP CK.1983; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1983; VOL. 16; NO 4; PP. 181-182; BIBL. 2 REF.Article

SHORTEST DISTANCES IN A MODIFIED TRANSPORTATION NETWORK.VAN OUDHEUSDEN DL.1977; GEOGR. ANAL.; U.S.A.; DA. 1977; VOL. 9; NO 3; PP. 257-265; BIBL. 11 REF.Article

ALGEBRAIC COMPLEXITY OF PATH PROBLEMSMAHR B.1982; R.A.I.R.O., INFORM. THEOR.; ISSN 0399-0540; FRA; DA. 1982; VOL. 16; NO 3; PP. 263-292; ABS. FRE; BIBL. 2 P.Article

SHORTEST-ROUTE METHODS. I: REACHING, PRUNING, AND BUCKETSDENARDO EV; FOX BL.1979; OPER. RES.; USA; DA. 1979; VOL. 27; NO 1; PP. 161-186; BIBL. 29 REF.Article

SHORTEST PATH ALGORITHMSICHIMORI T; ISHI H; NISHIDA T et al.1981; TECHNOL. REP. OSAKA UNIV.; ISSN 0030-6177; JPN; DA. 1981; VOL. 31; NO 1606-1629; PP. 197-204; BIBL. 7 REF.Article

INFORMATION BOUNDS ARE WEAK IN THE SHORTEST DISTANCE PROBLEMGRAHAM RL; YAO AC; YAO FF et al.1980; J. ASS. COMPUTG MACHIN.; USA; DA. 1980; VOL. 27; NO 3; PP. 428-444; BIBL. 14 REF.Article

WEAKLY ADMISSIBLE TRANSFORMATIONS FOR SOLVING ALGEBRAIC ASSIGNMENT AND TRANSPORTATION PROBLEMSBURKARD RE; ZIMMERMANN U.1980; MATH. PROGRAMMG STUDY; NLD; DA. 1980; NO 12; PP. 1-18; BIBL. 11 REF.Article

ON ALGORITHMS FOR FINDING THE K SHORTEST PATHS IN A NETWORKSHIER DR.1979; NETWORKS; USA; DA. 1979; VOL. 9; NO 3; PP. 195-214; BIBL. 20 REF.Article

SHORTEST ROUTE WITH TIME DEPENDENT LENGTH OF EDGES AND LIMITED DELAY POSSIBILITIES IN NODES.HALPERN J.1977; Z. OPER. RES.; DTSCH.; DA. 1977; VOL. 21; NO 3; PP. 117-124; ABS. ALLEM.; BIBL. 5 REF.Article

FINDING MINIMUM SPANNING TREES.CHERITON D; TARJAN RE.1976; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1976; VOL. 5; NO 4; PP. 724-742; BIBL. 21 REF.Article

A DECOMPOSITION ALGORITHM FOR LOCATING A SHORTEST PATH BETWEEN TWO NODES IN A NETWORKJARVIS JJ; TUFEKCI S.1982; NETWORKS; ISSN 0028-3045; USA; DA. 1982; VOL. 12; NO 2; PP. 161-172; BIBL. 25 REF.Article

PROPERTIES OF LABELING METHODS FOR DETERMINING SHORTEST PATH TREESSHIER DR; WITZGALL C.1981; J. RES. NATL. BUR. STAND.; ISSN 0091-0635; USA; DA. 1981; VOL. 86; NO 3; PP. 317-330; BIBL. 14 REF.Article

FINDING THE K LEAST COST PATHS IN AN ACYCLIC ACTIVITY NETWORKHORNE GJ.1980; J. OPERAT. RES. SOC.; GBR; DA. 1980; VOL. 31; NO 5; PP. 443-448; BIBL. 12 REF.Article

A DYKSTRA-LIKE SHORTEST PATH ALGORITHM FOR CERTAIN CASES OF NEGATIVE ARC LENGTHSSUKHAMAY KUNDU.1980; BIT (NORD. TIDSKR. INF-BEHANDL.); ISSN 0006-3835; SWE; DA. 1980; VOL. 20; NO 4; PP. 522-524; BIBL. 6 REF.Article

RELIABILITY EVALUATION OF A NETWORK WITH DELAYPARK YJ; TANAKA S.1979; I.E.E.E. TRANS. RELIABIL.; USA; DA. 1979; VOL. 28; NO 4; PP. 320-324; BIBL. 10 REF.Article

A PROBLEM IN NETWORK INTERDICTIONGOLDEN B.1979; NAV. RES. LOGIST. QUART.; USA; DA. 1979; VOL. 25; NO 4; PP. 711-713; BIBL. 5 REF.Article

BESTIMMUNG VON R KUERZESTEN WEGEN IN NETZWERKEN UNTER NEBENBEDINGUNGEN: VERFAHREN VOM HOFFMAN-PAVLEY-TYP. = DETERMINATION DES R-PLUS COURTS CHEMINS DANS DES RESEAUX AVEC CONTRAINTES: ALGORITHME DU TYPE HOFFMAN-PAVLEYDEJON B.1977; SER. INTERNATION. ANAL. NUMER.; SUISSE; DA. 1977; VOL. 36; PP. 47-54; BIBL. 4 REF.Article

USING SHORTEST PATHS IN SOME TRANSSHIPMENT PROBLEMS WITH CONCAVE COSTS.DAENINCK G; SMEERS Y.1977; MATH. PROGRAMMG; NETHERL.; DA. 1977; VOL. 12; NO 1; PP. 18-25; BIBL. 11 REF.Article

SUR UN ALGORITHME DE RECHERCHE DES SOLUTIONS OPTIMALES DANS LES PROBLEMES DE CONCEPTION AUTOMATISEEDUBOV YU A; EPIKHOVA NV.1976; AVTOMAT. I TELEMEKH.; S.S.S.R.; DA. 1976; NO 8; PP. 95-100; ABS. ANGL.; BIBL. 7 REF.Article

ALGORITHMES DE REPARTITION SUCCESSIVE ET DE TRACE OPTIMALBOCHKO GD; KASHIN VI; MAKAROV LI et al.1975; VYCHISLIT. SIST.; S.S.S.R.; DA. 1975; NO 64; PP. 73-81; BIBL. 3 REF.Article

PARALLEL ALGORITHMS FOR THE SINGLE SOURCE SHORTEST PATH PROBLEMMATETI P; DEO N.1982; COMPUTING (WIEN); ISSN 0010-485X; AUT; DA. 1982; VOL. 29; NO 1; PP. 31-49; ABS. GER; BIBL. 26 REF.Article

AN ADAPTIVE, ORDERED, GRAPH SEARCH TECHNIQUE FOR DYNAMIC TIME WARPING FOR ISOLATED WORD RECOGNITIONBROWN MK; RABINER LR.1982; IEEE TRANS. ACOUST. SPEECH SIGNAL PROCESS; ISSN 0096-3518; USA; DA. 1982; VOL. 30; NO 4; PP. 535-544; BIBL. 14 REF.Article

RECHERCHE DU CHEMIN OPTIMAL D'UN GRAPHE DANS L'ESPACE D'ETATPETRENKO AI; TETEL'BAUM A YA; SHRAMCHENKO BL et al.1980; IZV. AKAD. NAUK SSSR, TEH. KIBERN.; ISSN 0002-3388; SUN; DA. 1980; NO 6; PP. 119-125; BIBL. 10 REF.Article

A DUAL ALGORITHM FOR THE CONSTRAINED SHORTEST PATH PROBLEMHANDLER GY; ZANG I.1980; NETWORKS; ISSN 0028-3045; USA; DA. 1980; VOL. 10; NO 4; PP. 293-310; BIBL. 15 REF.Article

  • Page / 125