Strong regularity of matrices: a survey of resultsBUTKOVIC, P.Discrete applied mathematics. 1994, Vol 48, Num 1, pp 45-68, issn 0166-218XArticle

Computing Euclidean bottleneck matchings in higher dimensionsEFRAT, A; KATZ, M. J.Information processing letters. 2000, Vol 75, Num 4, pp 169-174, issn 0020-0190Article

KNPC DEBOTTLENECKS REVAMPS SHUAIBA PLANT = KNPC SUPPRIME LES GOULOTS D'ETRANGLEMENT ET MODERNISE LA RAFFINERIE DE SHUAIBAMALATY SA.1975; OIL GAS J.; U.S.A.; DA. 1975; VOL. 73; NO NO 7; PP. 107-110; BIBL. 1 REF.Article

DETERMINATION DES GOULOTS D'ETRANGLEMENTALI BENDANI.1974; IN: 4TH INT. CONF. LIQUEFIED NAT. GAS. PAP.; ALGIERS; 1974; CHICAGO; INST. GAS TECHNOL.; DA. 1974; PP. (15 P.); ABS. ANGLConference Paper

On the bottleneck counting argumentSIMON, J; TSAI, S.-C.Theoretical computer science. 2000, Vol 237, Num 1-2, pp 429-437, issn 0304-3975Article

The Pathologies of Big DataJACOBS, Adam.Communications of the ACM. 2009, Vol 52, Num 8, pp 36-44, issn 0001-0782, 9 p.Article

Comment on entropy bottlenecks in ion-molecule reactions Reply to comments of Truhlar and Chesnavich-BowersCHESNAVICH, W. J; BOWERS, M. T; DODD, J. A et al.The Journal of chemical physics. 1985, Vol 82, Num 4, pp 2168-2170, issn 0021-9606Article

Problème du flot maximal dans les goulots d'étranglementAKULICH, F. E.Vesci Akademii navuk BSSR. Seryâ fizika-matematyčnyh navuk. 1983, Num 3, pp 17-20, issn 0002-3574Article

New layouts for multi-stage interconnection networksCAHIT, Ibrahim; ADALIER, Ahmet.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-25339-4, 2Vol, Part I, 842-848Conference Paper

The communication complexity of approximate set packing and coveringNISAN, Noam.Lecture notes in computer science. 2002, pp 868-875, issn 0302-9743, isbn 3-540-43864-5, 8 p.Conference Paper

FUEL CYCLE BOTTLENECKS = GOULOTS D'ETRANGLEMENT DANS LE CYCLE DU COMBUSTIBLE NUCLEAIRE1974; NUCL. INDUSTRY; U.S.A.; DA. 1974; VOL. 21; NO 11; PP. 23-26Article

Optimal feedback control for a class of bottleneck problemsMIRICA, S.Journal of mathematical analysis and applications. 1985, Vol 112, Num 1, pp 221-235, issn 0022-247XArticle

Solution structures and sensitivity of special assignment problemsEISELT, H. A; GERCHAK, Y.Computers & operations research. 1984, Vol 11, Num 4, pp 397-399, issn 0305-0548Article

REISSVERSCHLUSSVERFAHREN ZUR REGELUNG DES VERKEHRS AN ENGSTELLEN = APPLICATION DU PRINCIPE DE LA "FERMETURE ECLAIR" A LA REGULATION DU TRAFIC AUX GOULOTS D'ETRANGLEMENTBOLL C.1980; FORSCH. STRASSENB. STRASSENVERKEHRSTECH.; ISSN 0344-0788; DEU; DA. 1980; NO 291; 94 P.; ABS. ENG/FRE; BIBL. 3 P.Serial Issue

SUPPRESSION DES GOULOTS D'ETRANGLEMENT DE LA REGION LYONNAISEARNOLD C; PAIRIN G.1982; REV. GEN. CH. DE FER; ISSN 0035-3183; FRA; DA. 1982; VOL. 101; NO 3; PP. 149-158Article

On available bandwidth measurement implementation and experimentJINGSHA HE.Conference on Local Computer Networks. 2004, pp 772-773, isbn 0-7695-2260-2, 1Vol, 2 p.Conference Paper

The random linear bottleneck assignment problemPFERSCHY, U.RAIRO. Recherche opérationnelle. 1996, Vol 30, Num 2, pp 127-142, issn 0399-0559Article

Finite dominating sets for network location problemsHOOKER, J. N; GARFINKEL, R. S; CHEN, C. K et al.Operations research. 1991, Vol 39, Num 1, pp 100-118, issn 0030-364XArticle

Single track line capacity modelJANIC, M.Transportation planning and technology (Print). 1984, Vol 9, Num 2, pp 135-151, issn 0308-1060Article

Identifying informative subsets of the Gene Ontology with information bottleneck methodsBO JIN; XINGHUA LU.Bioinformatics (Oxford. Print). 2010, Vol 26, Num 19, pp 2445-2451, issn 1367-4803, 7 p.Article

IDENTIFYING PERFORMANCE BOTTLENECKS IN WORK-STEALING COMPUTATIONS : Tools and Environments for Multicore and Many-Core ArchitecturesTALLENT, Nathan R; MELLOR-CRUMMEY, John M.Computer (Long Beach, CA). 2009, Vol 42, Num 12, pp 44-50, issn 0018-9162, 7 p.Article

An instant solution of the 2×n bottleneck transportation problemSZWARC, W.Operations research letters. 1993, Vol 14, Num 5, pp 261-264, issn 0167-6377Article

A three rounds property of the AESMINIER, Marine.Lecture notes in computer science. 2005, pp 16-26, issn 0302-9743, isbn 3-540-26557-0, 11 p.Conference Paper

A variant of time minimizing assignment problemARORA, S; PURI, M. C.European journal of operational research. 1998, Vol 110, Num 2, pp 314-325, issn 0377-2217Article

Nonlinear one-parametric bottleneck linear programmingSCHUBERT, I. S; ZIMMERMANN, U.Zeitschrift für Operations Research. 1985, Vol 29, Num 5, pp 187-202, issn 0373-790XArticle