A SUCCESSIVE SHORTEST PATH ALGORITHM FOR THE ASSIGNMENT PROBLEMENGQUIST M.1982; INFOR (OTTAWA); ISSN 0315-5986; CAN; DA. 1982; VOL. 20; NO 4; PP. 370-384; ABS. FRE; BIBL. 19 REF.Article

ON THE DECISION TREE COMPLEXITY OF THE SHORTEST PATH PROBLEMS.FREDMAN ML.1975; IN: ANNU. SYMP. FOUND. COMPUT. SCI. 16; BERKELEY, CALIF.; 1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. 98-99; BIBL. 8 REF.Conference Paper

EIN ALGORITHMUS ZUR ERMITTLUNG K-BESTER KANTENFOLGEN ZWISCHEN ALLEN ECKEN EINES GRAPHEN = UN ALGORITHME POUR TROUVER TOUTES LES DISTANCES LES K-PLUS COURTES DANS UN RESEAUBEILNER H.1972; COMPUTING; AUSTR.; DA. 1972; VOL. 10; NO 3; PP. 205-220; ABS. ANGL.; BIBL. 4 REF.Serial Issue

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

ON FINDING AND UPDATING SPANNING TREES AND SHORTEST PATHS.SPIRA PM; PAN A.1975; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 3; PP. 375-380; BIBL. 6 REF.Article

ALGORITHMUS 20. EIN LEISTUNGSFAEHIGER ALGORITHMUS ZUR BESTIMMUNG VON K-KUERZESTEN WEGEN IN EINEM GRAPHEN. = ALGORITHME 20. UN ALGORITHME PUISSANT POUR LA K-IEME MEILLEURE ROUTE DANS UN GRAPHEWEIGAND MM.1974; COMPUTING; AUSTR.; DA. 1974; VOL. 12; NO 3; PP. 273-283; ABS. ANGL.; BIBL. 3 REF.Article

CALCULATING KTH SHORTEST PATHS = CALCUL DU KIEME CHEMIN PLUS COURTFOX BL.1973; INFOR; CANADA; DA. 1973; VOL. 11; NO 1; PP. 66-70; ABS. FR.; BIBL. 10 REF.Serial Issue

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

INTERVAL-REGULAR GRAPHSMULDER HM.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 41; NO 3; PP. 253-269; BIBL. 6 REF.Article

NAEHERUNGSVERFAHREN FUER DAS "UBERSCHUSS. BEDARF"-PROBLEM. = METHODES D'APPROXIMATION POUR LE PROBLEME D'OFFRE ET DE DEMANDEHEIN O.1975; ANGEW. INFORMAT.; DTSCH.; DA. 1975; VOL. 17; NO 8; PP. 324-326; ABS. ANGL.; BIBL. 6 REF.Article

SUR LES PERFORMANCES D'ALGORITHMES DE RECHERCHE DE CHEMINS MINIMAUX DANS LES GRAPHES CLAIRSEMES.FONTAN G.1974; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., V; FR.; DA. 1974; VOL. 8; NO 2; PP. 31-37; 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

OPTIMAL NETWORK CAPACITY PLANNING. A SHORTEST-PATH SCHEME.DOULLIEZ PJ; RAO MR.1975; OPER. RES.; U.S.A.; DA. 1975; VOL. 23; NO 4; PP. 810-818; BIBL. 10 REF.Article

DETERMINATION DE LA LONGUEUR DU PLUS COURT CHEMIN DANS UN GRAPHELITVAK EI; ZAVARIN AN.1974; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; S.S.S.R.; DA. 1974; NO 4; PP. 40-42; BIBL. 3 REF.Article

ON THE DYNAMICS OF A CLASS OF OPTIMUM ROUTING PROBLEMS.MICKLE MH; VOGT WG.1975; J. FRANKLIN INST.; U.S.A.; DA. 1975; VOL. 300; NO 1; PP. 7-23; BIBL. 12 REF.Article

SHORTEST PATH WITH TIME CONSTRAINTS ON MOVEMENT AND PARKING.HALPERN J; PRIESS I.1974; NETWORKS; U.S.A.; DA. 1974; VOL. 4; NO 3; PP. 241-253; BIBL. 6 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

A DUAL SIMPLEX ALGORITHM FOR FINDING ALL SHORTEST PATHSFLORIAN M; NGUYEN S; PALLOTINO S et al.1981; NETWORKS; ISSN 0028-3045; USA; DA. 1981; VOL. 11; NO 4; PP. 367-378; BIBL. 14 REF.Article

ZUVERLAESSIGKEITSANALYSEN VON SYSTEMEN MIT ALGOL-PROGRAMMEN. = LES ANALYSES DE FIABILITE DES SYSTEMES AU MOYEN DE PROGRAMMES ALGOLKAROLEWSKI H.1975; NACHR.-TECH., ELEKTRON.; DTSCH.; DA. 1975; VOL. 25; NO 11; PP. 417-421; ABS. RUSSE ANGL. FR.; BIBL. 3 REF.Article

ON COMPUTING SETS OF SHORTEST PATHS IN A GRAPH.MINIEKA E.1974; COMMUNIC. A.C.M.; U.S.A.; DA. 1974; VOL. 17; NO 6; PP. 351-353; BIBL. 13 REF.Article

PROCEDURES FOR THE REDUCTION OF ERRORS IN ROAD NETWORK DATA.GINSBURGH V; HANSEN P.1974; OPER. RES. QUART.; G.B.; DA. 1974; VOL. 25; NO 2; PP. 321-322; BIBL. 5 REF.Article

GRAPHENALGORITHMEN UND UEBERDECKUNGSPROBLEME. = ALGORITHMES DE GRAPHES ET PROBLEMES DE RECOUVREMENTPERL J.1974; COMPUTING; AUSTR.; DA. 1974; VOL. 13; NO 2; PP. 107-113; ABS. ANGL.; BIBL. 7 REF.Article

PROGRAMME DE CONSTRUCTION DU PLUS COURT CHEMIN NON FERME (GRAPHE) EN LANGAGE FORTRANTIMERKAEV VS.1974; VYCHISLIT. SIST.; S.S.S.R.; DA. 1974; NO 59; PP. 41-48; BIBL. 2 REF.Article

UEBER DIE BESTIMMUNG MINIMALER WEGE UND GERUESTE IN GRAPHEN. = SUR LA DETERMINATION DES CHEMINS MINIMAUX ET DES ARBRES MAXIMAUX DANS LES GRAPHESJUNG HA.1974; COMPUTING; AUSTR.; DA. 1974; VOL. 13; NO 3-4; PP. 249-252; ABS. ANGL.; BIBL. 5 REF.Article