Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("ALGORITHME DECOMPOSITION")

Publication Year[py]

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

Discipline (document) [di]

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

Author Country

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

Results 1 to 7 of 7

  • Page / 1
Export

Selection :

  • and

A DECOMPOSITION ALGORITHM FOR ARBORESCENCE INVENTORY SYSTEMSKALYMON BA.1972; OPER. RES.; U.S.A.; DA. 1972; VOL. 20; NO 4; PP. 860-874; BIBL. 8 REF.Serial Issue

OPTYMALIZACJA ROZPLYURE STRUMIENI INFORMACJI = OPTIMISATION DES FLOTS MULTICOMMODITE DANS UN RESEAU D'ORDINATEURSMOLISZ W.1979; ARCH. AUTOMAT. TELEMECH.; POL; DA. 1979; VOL. 24; NO 1; PP. 107-122; ABS. RUS/ENG; BIBL. 9 REF.Article

Applying quantifier elimination to stability analysis of difference schemesLISKA, R; STEINBERG, S.Computer journal (Print). 1993, Vol 36, Num 5, pp 496-503, issn 0010-4620Article

A simulation approach for optimal timber management schedulingHOGANSON, H. M; ROSE, D. W.Forest science. 1984, Vol 30, Num 1, pp 220-238, issn 0015-749XArticle

Parallel algorithms for solving aggregated shortest-path problemsROMEIJN, H. E; SMITH, R. L.Computers & operations research. 1999, Vol 26, Num 10-11, pp 941-953, issn 0305-0548Article

Finite-state modulation codes for data storageMARCUS, B. H; SIEGEL, P. H; WOLF, J. K et al.IEEE journal on selected areas in communications. 1992, Vol 10, Num 1, pp 5-37, issn 0733-8716Article

A new dantzig-wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup timesDEGRAEVE, Zeger; JANS, Raf.Operations research. 2007, Vol 55, Num 5, pp 909-920, issn 0030-364X, 12 p.Article

  • Page / 1