Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("OPTIMAL FLOW")

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 437

  • Page / 18
Export

Selection :

  • and

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

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

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

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

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

MAXIMUM FLOW IN A NETWORK WITH FUZZY ARC CAPACITIESCHANAS S; KOLODZIEJCZYK W.1982; FUZZY SETS SYST.; ISSN 0165-0114; NLD; DA. 1982; VOL. 8; NO 2; PP. 165-173; BIBL. 7 REF.Article

EQUILIBRIUM VS SYSTEM-OPTIMAL FLOW: SOME EXAMPLESSTEWART NF.1980; TRANSP. RES., A; GBR; DA. 1980; VOL. 14; NO 2; PP. 81-84; BIBL. 6 REF.Article

PROBLEMY OPTIMALNI ORGANIZACE TOKU V DOPRAVNI SITI = ORGANISATION OPTIMALE DES FLOTS DANS UN RESEAU DE TRANSPORTPLASIL J.1980; EKON.-MAT. OBZ.; CSK; DA. 1980; VOL. 16; NO 1; PP. 56-63; ABS. ENGArticle

ALGORITHME DE DECOMPOSITION D'UN RESEAU POUR LA RESOLUTION DU PROBLEME DU FLOT MAXIMALAKULICH FE.1978; VESCI AKAD. NAVUK B.S.S.R., FIZ.-MAT. NAVUK; S.S.S.R.; DA. 1978; NO 1; PP. 33-37; ABS. ANGL.; BIBL. 4 REF.Article

SYSTEME DE FLOTS DANS UN RESEAULOMONOSOV MV.1978; PROBL. PEREDACHI INFORM.; SUN; DA. 1978; VOL. 14; NO 4; PP. 60-73; BIBL. 10 REF.Article

OPTIMISATION DE LA DISTRIBUTION DES FLOTS DANS UN RESEAU AVEC PERTESLUK'YANOV AV; PERVOZVANSKIJ AA.1983; AVTOMATIKA I TELEMEHANIKA; ISSN 0005-2310; SUN; DA. 1983; NO 1; PP. 125-130; ABS. ENG; BIBL. 2 REF.Article

PROBLEME DE PLANIFICATION DES TRANSPORTS CONSIDERE COMME UN PROBLEME D'OPTIMISATION DES FLOTS INTERCONNECTESMOISEENKO GE.1982; AVTOM. TELEMEH.; ISSN 0005-2310; SUN; DA. 1982; NO 8; PP. 135-144; ABS. ENG; BIBL. 9 REF.Article

COMPUTATIONAL COMPARISON OF EIGHT METHODS FOR THE MAXIMUM NETWORK FLOW PROBLEMTO YAT CHEUNG.1980; A.C.M. TRANS. MATH. SOFTWARE; USA; DA. 1980; VOL. 6; NO 1; PP. 1-16; BIBL. 15 REF.Article

PROBLEME DE FLOT MINIMAL DANS UN RESEAU ET LES ALGORITHMES POUR LE RESOUDREVOJTISHIN YU V.1980; KIBERNETIKA; UKR; DA. 1980; NO 1; PP. 116-118; BIBL. 5 REF.Article

MULTI-TERMINAL 0-1 FLOWSHILOACH Y.1979; S.I.A.M.J. COMPUTG; USA; DA. 1979; VOL. 8; NO 3; PP. 422-430; BIBL. 2 REF.Article

PROBLEME DE TRANSPORT SUR UN RESEAU AVEC AMPLIFICATION DANS LES ARCSKHRANOVICH IL.1979; AVTOMAT. I TELEMEKH.; SUN; DA. 1979; NO 2; PP. 90-99; ABS. ENG; BIBL. 6 REF.Article

SUR UN PROBLEME DE LA THEORIE DES RESEAUX DE COMMUNICATIONZAJTSEV ID; SALYGA VI; VAJNER VG et al.1979; DOKL.-AKAD. NAUK UKR. SSR, SER. A; ISSN 0201-8446; UKR; DA. 1979; NO 12; PP. 1035-1039; ABS. ENG; BIBL. 6 REF.Article

A NOTE ON PRIMAL NETWORK FLOW ALGORITHMSHAESSIG K; REISER P; STIERLIN C et al.1978; Z. OPER. RES.; DEU; DA. 1978; VOL. 22; NO 5; PP. 195-198; ABS. GER; BIBL. 4 REF.Article

A PRODUCT FROM REPRESENTATION OF THE INVERSE OF A MULTICOMMODITY CYCLE MATRIX.HELGASON RV; KENNINGTON JL.1977; NETWORKS; U.S.A.; DA. 1977; VOL. 7; NO 4; PP. 297-322; BIBL. 4 P. 1/2Article

A CLASS OF CONTINUOUS NETWORK FLOW PROBLEMSANDERSON EJ; NASH P; PHILIPOTT AB et al.1982; MATH. OPER. RES.; ISSN 0364-765X; USA; DA. 1982; VOL. 7; NO 4; PP. 501-514; BIBL. 6 REF.Article

METHODE DE RESOLUTION DU PROBLEME PARAMETRIQUE DE DETERMINATION DE LA CIRCULATION DE COUT MINIMAL DANS UN RESEAU AVEC UNE FONCTION DE COUT LINEAIRESEROV SS.1980; AVTOM. TELEMEH.; ISSN 0005-2310; SUN; DA. 1980; NO 12; PP. 108-115; ABS. ENG; BIBL. 3 REF.Article

ENGPAESSE, STAUSTELLEN UND GLATTE HOMOGENE STROEME IN NETZEN. EINE ALTERNATIVE ZU STECKHAN'S KONZEPT = GOULOTS D'ETRANGLEMENT ENCOMBREMENTS ET FLOTS HOMOGENES REGULIERS DANS LES RESEAUX. UNE ALTERNATIVE DE CONCEPT DE STECKHANHASSIG K; SENN W.1979; Z. OPER. RES.; DEU; DA. 1979; VOL. 23; NO 7; PP. 269-273; ABS. ENG; BIBL. 1 REF.Article

PROBLEME DE TRANSPORT EN RESEAU NON HOMOGENEMEL'NIK IM.1978; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1978; NO 2; PP. 69-72; ABS. ANGL.; BIBL. 4 REF.Article

A NOTE ON FEASIBLE FLOWS IN LOWER-BOUNDED MULTICOMMODITY NETWORKSEVANS JR; MARTIN K.1978; J. OPERAT. RES. SOC.; GBR; DA. 1978; VOL. 29; NO 9; PP. 923-927; BIBL. 13 REF.Article

  • Page / 18