Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("FLOT OPTIMAL")

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 696

  • Page / 28

Export

Selection :

  • and

DOMAINS OF STRUCTURAL STABILITY FOR MINIMAL-COST DISCRETE FLOWS WITH REFERENCE TO THE HIERARCHICAL CENTRAL-PLACE MODELSSONIS M.1982; ENVIRON. PLANN. A; ISSN 0308-518X; GBR; DA. 1982; VOL. 14; NO 4; PP. 455-469; BIBL. 10 REF.Article

FLOTS DANS LES RESEAUX AVEC DES FONCTIONS ECONOMIQUES QUADRATIQUESPETER K.1975; ALKALMAZOTT MAT. LAPOK; MAGYAR.; DA. 1975; NO 1-2; PP. 101-108; ABS. ANGL.; BIBL. 6 REF.Article

ALGORITHME ECONOMIQUE DE RECHERCHE DU FLOT MAXIMAL DANS UN RESEAUKARZANOV AV.1975; EKON. MAT. METODY; S.S.S.R.; DA. 1975; VOL. 11; NO 4; PP. 723-729; BIBL. 2 REF.Article

IMPLEMENTATION AND COMPUTATIONAL OF PRIMAL, DUAL AND PRIMAL-DUAL COMPUTER CODES FOR MINIMUM COST NETWORK FLOW PROBLEMS.GLOVER F; KARNEY D; KLINGMAN D et al.1974; NETWORKS; U.S.A.; DA. 1974; VOL. 4; NO 3; PP. 191-212; BIBL. 2 P. 1/2Article

OPTIMAL FLOWS IN NETWORKS WITH MULTIPLE SOURCES AND SINKS.MEGIDDO N.1974; MATH. PROGRAMMG; NETHERL.; DA. 1974; VOL. 7; NO 1; PP. 97-107; BIBL. 4 REF.Article

MINIMUM COST FLOW WITH SET-CONSTRAINTSHASSIN R.1982; NETWORKS; ISSN 0028-3045; USA; DA. 1982; VOL. 12; NO 1; PP. 1-21; BIBL. 12 REF.Article

MAXIMUM FLOW IN (S,T) PLANAR NETWORKSHASSIN R.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 3; PP. 107; BIBL. 3 REF.Article

AN EXTENDED ABSTRACT OF AN INDEPTH ALGORITHMIC AND COMPUTATIONAL STUDY FOR MAXIMUM FLOW PROBLEMSGLOVER F; KLINGMAN D; MOTE J et al.1980; DISCRETE APPL. MATH.; NLD; DA. 1980; VOL. 2; NO 3; PP. 251-254; BIBL. 4 REF.Article

A GENERALIZED DYNAMIC FLOWS PROBLEMHALPERN J.1979; NETWORKS; USA; DA. 1979; VOL. 9; NO 2; PP. 133-167; BIBL. 9 REF.Article

NETWORK FLOW AND TESTING GRAPH CONNECTIVITY.EVEN S; TARJAN RE.1975; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 4; PP. 507-518; BIBL. 11 REF.Article

SOLUTION D'UN PROBLEME DE TRANSPORT A PLUSIEURS INDICESARET L.1974; IZVEST. AKAD. NAUK ESTON S.S.R., FIZ. MAT.; S.S.S.R.; DA. 1974; VOL. 23; NO 2; PP. 155-159; ABS. EST. ANGL.; BIBL. 4 REF.Article

MINIMAX COST FLOW PROBLEMICHIMORI T; MURATA M; ISHII H et al.1980; TECHNOL. REP. OSAKA UNIV.; ISSN 0030-6177; JPN; DA. 1980; VOL. 30; NO 1517-1550; PP. 39-44; BIBL. 3 REF.Article

HYDRAULIC NETWORK ANALYSIS USING (GENERALIZED) GEOMETRIC PROGRAMMING.HALL MA.1976; NETWORKS; U.S.A.; DA. 1976; VOL. 6; NO 2; PP. 105-130; BIBL. 2 P.Article

AN AUGMENTING PATH METHOD FOR SOLVING LINEAR BOTTLENECK TRANSPORTATION PROBLEMSDERIGS U; ZIMMERMANN U.1979; COMPUTING; AUT; DA. 1979; VOL. 22; NO 1; PP. 1-15; ABS. GER; BIBL. 16 REF.Article

SUR LES FLOTS DE PLUSIEURS MARCHANDISES DANS LES RESEAUX DE COMMUNICATIONALESKEROV SA; GRIGOROVICH AF.1975; DOKL. AKAD. NAUK S.S.S.R.; S.S.S.R.; DA. 1975; VOL. 220; NO 6; PP. 1286-1288; BIBL. 17 REF.Article

FLOT MAXIMAL DANS UN RESEAU DE TRANSPORT DANS LEQUEL LES PERMEABILITES SONT DES INTERVALLES FERMESRUSNAK O.1971; EKON.-MAT. OBZ.; CESKOL.; DA. 1971; VOL. 7; NO 4; PP. 440-444; ABS. ANGL.; BIBL. 1 REF.Serial Issue

EIN GRAPHENTHEORETISCHER ALGORITHMUS FUER EINIGE FLUSSPROBLEME IN NETZWERKEN MIT KANTENGEWINNEN. = UN ALGORITHME DE LA THEORIE DES GRAPHES POUR QUELQUES PROBLEMES DE FLOTS DANS DES RESEAUX DE TRANSFERT AVEC GAINSHORST R.1976; COMPUTING; AUSTR.; DA. 1976; VOL. 17; NO 2; PP. 121-127; ABS. ANGL.; BIBL. 6 REF.Article

POTOKOVYE ALGORITMY. = ALGORITHMES DE FLOTSADEL'SON VEL'SKIJ GM; DINITS EA; KARZANOV AV et al.1975; MOSKVA; NAUKA; DA. 1975; PP. 1-119; BIBL. 2 P.Book

MAXIMAL FLOW WITH GAINS THROUGH A SPECIAL NETWORKJARVIS JJ; JEZIOR AM.1972; OPER. RES.; U.S.A.; DA. 1972; VOL. 20; NO 3; PP. 678-688; BIBL. 13 REF.Serial Issue

MAXIMUM FLOW IN NETWORKS WITH A SMALL NUMBER OF RANDOM ARC CAPACITIESSOMERS JE.1982; NETWORKS; ISSN 0028-3045; USA; DA. 1982; VOL. 12; NO 3; PP. 241-253; BIBL. 9 REF.Article

OPTIMISATION DE LA REPARTITION DES FLOTS DANS LES RESEAUX DE TRANSPORT NON LINEAIRESMALKIN EI.1974; IN: SOVREM. PROBL. UPR.; MOSKVA; NAUKA; DA. 1974; PP. 144-148; BIBL. 12 REF.Book Chapter

SUR LE CALCUL DE LA CAPACITE DE TRANSMISSION DES RESEAUX DYNAMIQUESMEJZIN LK.1983; AVTOMATIKA I TELEMEHANIKA; ISSN 0005-2310; SUN; DA. 1983; NO 8; PP. 142-149; ABS. ENG; BIBL. 6 REF.Article

MAXIMALE FLUESSE IN NETZWERKEN MIT KANTENGEWINNEN: VERGLEICH DREIER ALGORITHMEN = FLOTS MAXIMAUX DANS LES RESEAUX AVEC GAINS: COMPARAISON DE TROIS ALGORITHMESHORST R.1980; ANGEW. INFORMAT.; DEU; DA. 1980; VOL. 22; NO 3; PP. 116-118; ABS. ENG; BIBL. 10 REF.Article

ON FULKERSON'S CONJECTURE ABOUT CONSISTENT LABELING PROCESSESMEGIDDO N; GALIL Z.1979; MATH. OPER. RES.; USA; DA. 1979; VOL. 4; NO 3; PP. 265-267; BIBL. 4 REF.Article

INTERACTION DES FLOTS DE TRANSPORT CONFLUENTS DE TYPE POISSONIEN, EN L'ABSENCE DE REGULATIONPODDUBNYJ GV; ZIL'DMAN V YA.1977; EKON. MAT. METODY; S.S.S.R.; DA. 1977; VOL. 13; NO 3; PP. 524-535; BIBL. 8 REF.Article

  • Page / 28