Probabilistic analysis of optimization algorithms-some aspects from a practical point of view
Saved in:
| Published in | Acta applicandae mathematicae Vol. 10; no. 2; pp. 171 - 210 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
01.10.1987
|
| Online Access | Get full text |
| ISSN | 0167-8019 1572-9036 1572-9036 |
| DOI | 10.1007/BF00046618 |
Cover
| Author | Borgwardt, K. H. |
|---|---|
| Author_xml | – sequence: 1 givenname: K. H. surname: Borgwardt fullname: Borgwardt, K. H. |
| BookMark | eNptkE1LxDAQQIOs4O7qxV-Qs1Kd9CNtjrq4Kgh62KuUSZpqJG1KEl3WX2_XVQT1NId5b2DejEx612tCjhmcMYDy_HIJADnnrNojU1aUaSIg4xMyBcbLpAImDsgshJeRygTnU_L44J1EaawJ0SiKPdpNMIG6lrohms68YzSup2ifnDfxuQtJcJ2mGAatYqCtdx1FOnhUo4-WDs70cau_Gb0-JPst2qCPvuacrJZXq8VNcnd_fbu4uEtUysuYNEKkrNCNANQSdC5ThpkoVCMRmkpyDSwvmywdFwXjbZ6CELpS-fhCIVuRzcnp7uxrP-BmjdbWgzcd-k3NoN6GqWX7HWakT3a08i4Er9s_8E_FEYZfsDLxM0n0aOx_ygddL3X9 |
| CitedBy_id | crossref_primary_10_1080_02331939008843629 crossref_primary_10_1007_BF02331572 |
| Cites_doi | 10.1287/moor.10.2.328 10.1007/978-3-642-61578-8 10.1287/moor.9.1.43 10.1007/BF01583791 10.1093/comjnl/9.3.275 10.1287/moor.6.4.485 10.1080/00029890.1969.12000279 10.1287/moor.3.2.89 10.1137/0206050 10.1137/0208036 10.1007/3-540-10856-4_110 10.1007/978-3-663-12191-6 10.1287/moor.10.2.180 10.1287/moor.9.1.142 10.1287/moor.4.4.339 10.1007/BF02612362 10.1016/0012-365X(76)90068-6 10.1007/BF02579273 10.1016/S0167-5060(08)70322-4 10.1016/B978-0-12-566780-7.50016-7 10.1007/BF01585093 10.1090/S0002-9939-1980-0560587-2 10.1137/0211003 10.1287/moor.10.1.100 10.1287/moor.5.1.1 10.1007/BF01386390 10.1007/BF02591902 10.5486/PMD.1959.6.3-4.12 10.1007/978-3-642-68874-4_20 10.4153/CJM-1961-029-9 10.4153/CJM-1959-003-9 10.1287/moor.7.3.441 10.1007/BF01721246 10.1287/moor.5.1.27 10.1137/0202004 10.1007/BF01581043 10.1016/0166-218X(82)90055-5 10.1016/0166-218X(85)90037-X |
| ContentType | Journal Article |
| DBID | AAYXX CITATION ADTOC UNPAY |
| DOI | 10.1007/BF00046618 |
| DatabaseName | CrossRef Unpaywall for CDI: Periodical Content Unpaywall |
| DatabaseTitle | CrossRef |
| Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 1572-9036 |
| EndPage | 210 |
| ExternalDocumentID | oai:uni-augsburg.opus-bayern.de:14325 10_1007_BF00046618 |
| GroupedDBID | -Y2 -~C -~X .86 .VR 06D 0R~ 0VY 199 1N0 1SB 2.D 203 23M 28- 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 7WY 88I 8AO 8FE 8FG 8FL 8FW 8G5 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAPKM AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYXX AAYZH ABAKF ABBBX ABBRH ABBXA ABDBE ABDBF ABDZT ABECU ABFSG ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABRTQ ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACGOD ACHSB ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSTC ACUHS ACZOJ ADHHG ADHIR ADHKG ADIMF ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AEZWR AFBBN AFDZB AFEXP AFFNX AFGCZ AFHIU AFKRA AFLOW AFOHR AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGQPQ AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHPBZ AHSBF AHWEU AHYZX AIAKS AIGIU AIIXL AILAN AITGF AIXLP AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMVHM AMXSW AMYLF AMYQR AOCGG ARAPS ARMRJ ASPBG ATHPR AVWKF AXYYD AYFIA AYJHY AZFZN AZQEC B-. BA0 BAPOH BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU CITATION COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DWQXO EBLON EBS EIOEI EJD ESBYG ESX F5P FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ7 GQ8 GROUPED_ABI_INFORM_RESEARCH GUQSH GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ ITM IWAJR IXC IXE IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K60 K6V K6~ K7- KDC KOV KOW L6V LAK LLZTM M0C M2O M2P M4Y M7S MA- N2Q NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P62 P9R PF0 PHGZM PHGZT PQBIZ PQBZA PQGLB PQQKQ PROAC PT4 PT5 PTHSS PUEGO Q2X QOK QOS R4E R89 R9I RHV RNI ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCLPG SDD SDH SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 ZMTXR ZWQNP ~8M ~A9 ~EX ADTOC UNPAY |
| ID | FETCH-LOGICAL-c267t-d99215ed90aeb0e4b21a395cdba0d8b6e0147d324b2516f42099e8c43965bf93 |
| IEDL.DBID | UNPAY |
| ISSN | 0167-8019 1572-9036 |
| IngestDate | Sun Oct 26 03:22:32 EDT 2025 Wed Oct 01 01:43:31 EDT 2025 Thu Apr 24 22:50:18 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| License | https://www.springer.com/tdm |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c267t-d99215ed90aeb0e4b21a395cdba0d8b6e0147d324b2516f42099e8c43965bf93 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-143255 |
| PageCount | 40 |
| ParticipantIDs | unpaywall_primary_10_1007_bf00046618 crossref_primary_10_1007_BF00046618 crossref_citationtrail_10_1007_BF00046618 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 1900 |
| PublicationDate | 1987-10-00 |
| PublicationDateYYYYMMDD | 1987-10-01 |
| PublicationDate_xml | – month: 10 year: 1987 text: 1987-10-00 |
| PublicationDecade | 1980 |
| PublicationTitle | Acta applicandae mathematicae |
| PublicationYear | 1987 |
| References | R. M. Karp (BF00046618_CR40) 1985 P. O. Lindberg (BF00046618_CR50) 1980 R. Loulou (BF00046618_CR53) 1984; 9 P. G. Gazmuri (BF00046618_CR33) 1985; 10 J. K. Lenstra (BF00046618_CR48) 1977 A. M. Frieze (BF00046618_CR30) 1985 M. Haimovich (BF00046618_CR37) 1983 R. E. Burkard (BF00046618_CR17) 1983; 27 BF00046618_CR11 M. J. Todd (BF00046618_CR65) 1983 S. E. Berenguer (BF00046618_CR9) 1985; 35 B. Korte (BF00046618_CR45) 1978; 2 J. H. Halton (BF00046618_CR38) 1982; 11 R. Benveniste (BF00046618_CR8) 1982; 22 V. Lifschitz (BF00046618_CR52) 1980; 79 J. H. May (BF00046618_CR54) 1982; 24 M. Meanti (BF00046618_CR55) 1984 P. Erdös (BF00046618_CR24) 1959; 11 P. O. Lindberg (BF00046618_CR51) 1983 I. Adler (BF00046618_CR2) 1983 J. S. Carson (BF00046618_CR19) 1977; 6 D. Gale (BF00046618_CR31) 1969; 76 J. B. G. Frenk (BF00046618_CR29) 1982; 10 C. Blair (BF00046618_CR10) 1983 BF00046618_CR15 BF00046618_CR14 K. H. Borgwardt (BF00046618_CR13) 1982; 26 BF00046618_CR64 M. A. H. Dempster (BF00046618_CR21) 1983; 8 D. S. Hochbaum (BF00046618_CR39) 1985; 10 BF00046618_CR60 V. Klee (BF00046618_CR43) 1980; 5 D. M. Stein (BF00046618_CR63) 1978; 3 M. Grötschel (BF00046618_CR34) 1981; 1 S Smale (BF00046618_CR61) 1983; 27 P. Erdös (BF00046618_CR25) 1961; 13 P. M. Spira (BF00046618_CR62) 1973; 2 L. Posa (BF00046618_CR58) 1976; 14 R. M. Karp (BF00046618_CR41) 1976 R. E. Burkard (BF00046618_CR16) 1982; 23 P. Erdös (BF00046618_CR23) 1959; 6 R. Burkard (BF00046618_CR18) 1985; 12 B. L. Fox (BF00046618_CR28) 1977 R. Kemp (BF00046618_CR42) 1984 A. V. Aho (BF00046618_CR5) 1974 M. L. Fisher (BF00046618_CR27) 1984; 28 A. Bachem (BF00046618_CR7) 1984; 6 M. R. Garey (BF00046618_CR32) 1979 J. K. Lenstra (BF00046618_CR47) 1982 BF00046618_CR4 I. Adler (BF00046618_CR1) 1983 K. Lieberherr (BF00046618_CR49) 1981; 118 G. D'Atri (BF00046618_CR20) 1982; 4 E. L. Lawler (BF00046618_CR46) 1979; 4 E. W. Dijkstra (BF00046618_CR22) 1959; 1 E. M. Palmer (BF00046618_CR57) 1985 K. H. Borgwardt (BF00046618_CR12) 1982; 7 BF00046618_CR35 BF00046618_CR36 T. A. J. Nicholson (BF00046618_CR56) 1966; 9 D. W. Walkup (BF00046618_CR66) 1979; 8 I. Adler (BF00046618_CR3) 1983 BF00046618_CR44 Z. Artstein (BF00046618_CR6) 1981; 6 R. Shamir (BF00046618_CR59) 1984 M. L. Fisher (BF00046618_CR26) 1980; 5 |
| References_xml | – volume: 10 start-page: 328 year: 1985 ident: BF00046618_CR33 publication-title: Math. Operations Res. doi: 10.1287/moor.10.2.328 – ident: BF00046618_CR14 doi: 10.1007/978-3-642-61578-8 – ident: BF00046618_CR15 doi: 10.1287/moor.9.1.43 – volume: 23 start-page: 227 year: 1982 ident: BF00046618_CR16 publication-title: Mathematical Programming doi: 10.1007/BF01583791 – volume-title: On the exact solution of random travelling salesman problems with medium size integer coefficients year: 1985 ident: BF00046618_CR30 – volume: 9 start-page: 275 year: 1966 ident: BF00046618_CR56 publication-title: Computing J. doi: 10.1093/comjnl/9.3.275 – volume: 6 start-page: 485 year: 1981 ident: BF00046618_CR6 publication-title: Math. Operations Res. doi: 10.1287/moor.6.4.485 – volume-title: Computational complexity of discrete optimization problems year: 1977 ident: BF00046618_CR48 – volume: 27 start-page: 73 year: 1983 ident: BF00046618_CR17 publication-title: Zeit. Operations Res. – volume: 76 start-page: 589 year: 1969 ident: BF00046618_CR31 publication-title: Am. Math. Monthly doi: 10.1080/00029890.1969.12000279 – volume: 35 start-page: 1 year: 1985 ident: BF00046618_CR9 publication-title: Mathematical Programming Study – volume: 3 start-page: 89 year: 1978 ident: BF00046618_CR63 publication-title: Math. Operations Res. doi: 10.1287/moor.3.2.89 – volume: 6 start-page: 696 year: 1977 ident: BF00046618_CR19 publication-title: SIAM J. Computation doi: 10.1137/0206050 – volume-title: (min2, d2A simplex variant solving an m x d linear program in O)) expected number of pivot steps year: 1983 ident: BF00046618_CR2 – start-page: 1 volume-title: Algorithms and Complexity year: 1976 ident: BF00046618_CR41 – ident: BF00046618_CR36 – volume-title: A probabilistic analysis of the multiknapsack value function year: 1984 ident: BF00046618_CR55 – volume-title: Graphical Evolution: An Introduction to the Theory of Random Graphs year: 1985 ident: BF00046618_CR57 – volume: 8 start-page: 440 year: 1979 ident: BF00046618_CR66 publication-title: SIAM J. Computation doi: 10.1137/0208036 – volume: 118 start-page: 423 year: 1981 ident: BF00046618_CR49 publication-title: Lecture Notes in Computer Sci. doi: 10.1007/3-540-10856-4_110 – volume-title: Fundamentals of the Average Case Analysis of Particular Algorithms year: 1984 ident: BF00046618_CR42 doi: 10.1007/978-3-663-12191-6 – volume: 10 start-page: 180 year: 1985 ident: BF00046618_CR39 publication-title: Math. Operations Res. doi: 10.1287/moor.10.2.180 – volume: 9 start-page: 142 year: 1984 ident: BF00046618_CR53 publication-title: Math. Operations Res. doi: 10.1287/moor.9.1.142 – volume-title: Random linear programs with many variables and few constraints year: 1983 ident: BF00046618_CR10 – volume: 4 start-page: 339 year: 1979 ident: BF00046618_CR46 publication-title: Math. Operations Res. doi: 10.1287/moor.4.4.339 – volume-title: A simplex algorithm where the average number of steps is bounded between two quadratic functions of the smaller dimension year: 1983 ident: BF00046618_CR3 – volume-title: The simplex algorithm is very good! — On the expected number of pivot steps and related properties of random linear programs year: 1983 ident: BF00046618_CR37 – volume-title: An appraisal of computational complexity for operations researchers year: 1982 ident: BF00046618_CR47 – ident: BF00046618_CR4 – volume: 28 start-page: 218 year: 1984 ident: BF00046618_CR27 publication-title: Mathematical Programming doi: 10.1007/BF02612362 – volume: 14 start-page: 359 year: 1976 ident: BF00046618_CR58 publication-title: Discrete Math. doi: 10.1016/0012-365X(76)90068-6 – volume: 1 start-page: 169 year: 1981 ident: BF00046618_CR34 publication-title: Combinatorica doi: 10.1007/BF02579273 – volume: 8 start-page: 525 year: 1983 ident: BF00046618_CR21 publication-title: Results for Hierarchical Scheduling Problems – volume: 2 start-page: 65 year: 1978 ident: BF00046618_CR45 publication-title: Ann. Discrete Math. doi: 10.1016/S0167-5060(08)70322-4 – volume-title: Technical Report No. 595 year: 1983 ident: BF00046618_CR65 – ident: BF00046618_CR35 doi: 10.1016/B978-0-12-566780-7.50016-7 – start-page: 181 volume-title: The Travelling Salesman Problem year: 1985 ident: BF00046618_CR40 – volume: 24 start-page: 39 year: 1982 ident: BF00046618_CR54 publication-title: Mathematical Programming doi: 10.1007/BF01585093 – volume: 79 start-page: 72 year: 1980 ident: BF00046618_CR52 publication-title: Proc. AMS doi: 10.1090/S0002-9939-1980-0560587-2 – volume: 11 start-page: 28 year: 1982 ident: BF00046618_CR38 publication-title: SIAM J. Computation doi: 10.1137/0211003 – ident: BF00046618_CR44 – volume: 10 start-page: 100 year: 1982 ident: BF00046618_CR29 publication-title: Math. Operation Res. doi: 10.1287/moor.10.1.100 – volume: 5 start-page: 1 year: 1980 ident: BF00046618_CR43 publication-title: Math. Operations Res. doi: 10.1287/moor.5.1.1 – volume: 1 start-page: 269 year: 1959 ident: BF00046618_CR22 publication-title: Numerische Mathematik doi: 10.1007/BF01386390 – volume-title: Computers and Intractability: A Guide to the Theory of NP-Completeness year: 1979 ident: BF00046618_CR32 – volume: 27 start-page: 241 year: 1983 ident: BF00046618_CR61 publication-title: Mathematical Programming doi: 10.1007/BF02591902 – ident: BF00046618_CR11 – volume: 6 start-page: 290 year: 1959 ident: BF00046618_CR23 publication-title: Publ. Math. Debrecan doi: 10.5486/PMD.1959.6.3-4.12 – ident: BF00046618_CR60 doi: 10.1007/978-3-642-68874-4_20 – volume: 13 start-page: 346 year: 1961 ident: BF00046618_CR25 publication-title: Canadian J. Math. doi: 10.4153/CJM-1961-029-9 – volume: 11 start-page: 34 year: 1959 ident: BF00046618_CR24 publication-title: Canadian J. Math. doi: 10.4153/CJM-1959-003-9 – volume: 7 start-page: 441 year: 1982 ident: BF00046618_CR12 publication-title: Math. Operations Res. doi: 10.1287/moor.7.3.441 – volume-title: The Design and Analysis of Computer Algorithms year: 1974 ident: BF00046618_CR5 – volume: 6 start-page: 1 year: 1984 ident: BF00046618_CR7 publication-title: OR-Spektrum doi: 10.1007/BF01721246 – volume-title: On the lengths of simplex paths: the transportation case year: 1983 ident: BF00046618_CR51 – volume: 5 start-page: 27 year: 1980 ident: BF00046618_CR26 publication-title: Math. Operations Res. doi: 10.1287/moor.5.1.27 – volume-title: On the lengths of simplex paths: the assignment case year: 1980 ident: BF00046618_CR50 – ident: BF00046618_CR64 – volume-title: Branching from the largest upper bound: folklore and facts year: 1977 ident: BF00046618_CR28 – volume: 2 start-page: 28 year: 1973 ident: BF00046618_CR62 publication-title: SIAM J. Computation doi: 10.1137/0202004 – volume: 22 start-page: 261 year: 1982 ident: BF00046618_CR8 publication-title: Mathematical Programming doi: 10.1007/BF01581043 – volume-title: The efficiency of the simplex-method: a survey year: 1984 ident: BF00046618_CR59 – volume: 4 start-page: 329 year: 1982 ident: BF00046618_CR20 publication-title: Discrete Appl. Math. doi: 10.1016/0166-218X(82)90055-5 – volume: 26 start-page: 157 year: 1982 ident: BF00046618_CR13 publication-title: Zeit. Operations Res. – volume: 12 start-page: 21 year: 1985 ident: BF00046618_CR18 publication-title: Discrete Appl. Math. doi: 10.1016/0166-218X(85)90037-X – volume-title: A family of simplex variants solving an m x d linear program in expected number of pivot steps depending on d only year: 1983 ident: BF00046618_CR1 |
| SSID | ssj0003966 |
| Score | 1.2993013 |
| SourceID | unpaywall crossref |
| SourceType | Open Access Repository Enrichment Source Index Database |
| StartPage | 171 |
| Title | Probabilistic analysis of optimization algorithms-some aspects from a practical point of view |
| URI | https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-143255 |
| UnpaywallVersion | submittedVersion |
| Volume | 10 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVLSH databaseName: SpringerLink Journals customDbUrl: mediaType: online eissn: 1572-9036 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003966 issn: 1572-9036 databaseCode: AFBBN dateStart: 19830301 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1NS8NAEF20PYgHv0VFy4JePKyk7WbT7a0ViwiWHhRUENmPiYppUppU0V_vbJrUoh7Ea5iQJTO784bZ94aQIwikMuD5jNe5YRxrEKaCwDBpMFv6BiM6Z71f9sX5Nb-48W_mRn3FOmZYZyaRK6fzTj7-0TY-bVto61fdbrY4S0aTlDPM9IiHF0lV-AjDK6R63R90bkstbzx5Za6VGjSY9FyLciZNqsOcMyncoI-5ZLQ0iUfq_U1F0VyG6a2Su3Jt04slLyeTTJ-Yj2-yjf9a_BpZKXAn7UwDZZ0sQLxBli9noq3pJrkfjHFzu8uyTruZqkKuhCYhTfBgGRaMTaqix2T8nD0NU5YmQ6AqZ2um1DFVqKIF7wo_Nkqe48y97toPW-Sqd3Z1es6K6QvMNESQMSslwgGw0lOgPeC6UVdN6RurlWdbWgAWV4FFPKYRIomQOw4utAwCHOHrUDa3SSVOYtghVBhrtcebACC4DIUOwTQ8EFb5YOpeuEuOSy88mEKZ3A3IiB5KTeVur_TYLjmc2Y6mehy_Wh3NnPnD7Mv9e38z2yeVbDyBA0Qfma6RaqfX7fZrRbx9ArA93Jg |
| linkProvider | Unpaywall |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1NS8NAEF20HsSD36KisqAXDytpu9l0e6tiKYKlhwoqSNmPiYppUppU0V_vbJrUoh7Ea5iQJTO784bZ94aQEwikMuD5jFe5YRxrEKaCwDBpMFv6BiM6Z71fd0Xnhl_d-rdzo75iHTOsM5PIldN5Jx__aBOfNi009atu1hucJaNJyhlmesTDi2RJ-AjDK2Tppttr3ZVa3njyylwrNagx6bkW5UyaVIc5Z1K4QR9zyWh5Eo_U-5uKorkM014j9-XaphdLXs4mmT4zH99kG_-1-HWyWuBO2poGygZZgHiTrFzPRFvTLfLQG-PmdpdlnXYzVYVcCU1CmuDBMiwYm1RFj8n4OXsapixNhkBVztZMqWOqUEUL3hV-bJQ8x5l73bUftkm_fdm_6LBi-gIzNRFkzEqJcACs9BRoD7iuVVVd-sZq5dmGFoDFVWARj2mESCLkjoMLDYMAR_g6lPUdUomTGHYJFcZa7fE6AAguQ6FDMDUPhFU-mKoX7pHT0gsDUyiTuwEZ0aDUVD5vlx7bI8cz29FUj-NXq5OZM3-Yfbl__29mB6SSjSdwiOgj00dFnH0C05HbHA |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Probabilistic+analysis+of+optimization+algorithms-some+aspects+from+a+practical+point+of+view&rft.jtitle=Acta+applicandae+mathematicae&rft.au=Borgwardt%2C+K.+H.&rft.date=1987-10-01&rft.issn=0167-8019&rft.eissn=1572-9036&rft.volume=10&rft.issue=2&rft.spage=171&rft.epage=210&rft_id=info:doi/10.1007%2FBF00046618&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_BF00046618 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-8019&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-8019&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-8019&client=summon |