{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T12:24:07Z","timestamp":1765974247345},"reference-count":40,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1986,6,1]],"date-time":"1986-06-01T00:00:00Z","timestamp":517968000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9908,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1986,6]]},"DOI":"10.1016\/0166-218x(86)90058-2","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T15:17:01Z","timestamp":1034090221000},"page":"157-170","source":"Crossref","is-referenced-by-count":13,"title":["Randomized algorithms in combinatorial optimization: A survey"],"prefix":"10.1016","volume":"14","author":[{"given":"Francesco","family":"Maffioli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(86)90058-2_BIB1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","article-title":"Fast probabilistic algorithms for Hamiltonian circuits and matchings","volume":"18","author":"Angluin","year":"1979","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0166-218X(86)90058-2_BIB2","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0377-2217(84)90231-5","article-title":"A thermodynamically motivated simulation procedure for combinatorial optimization problems","volume":"17","author":"Burkard","year":"1984","journal-title":"Europ. J. Oper. Res."},{"key":"10.1016\/0166-218X(86)90058-2_BIB3","doi-asserted-by":"crossref","unstructured":"P. M. Camerini and F. Maffioli, Unlabelled partition systems: optimization and complexity, SIAM J. Algebraic Discrete Methods, 426\u2013441","DOI":"10.1137\/0605041"},{"key":"10.1016\/0166-218X(86)90058-2_BIB4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BFb0121102","article-title":"Some experience in applying a stochastic method to location problems","volume":"26","author":"Camerini","year":"1986","journal-title":"Math. Programming Study"},{"key":"10.1016\/0166-218X(86)90058-2_BIB5","series-title":"A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm","author":"C\u011brny","year":"1982"},{"key":"10.1016\/0166-218X(86)90058-2_BIB6","article-title":"Recerca di una base condizioni di parit\u00e1: realizzazione e applicazioni dell' algortimo casuale-polinomiale di Lov\u00e1sz","author":"Damiani","year":"1984"},{"key":"10.1016\/0166-218X(86)90058-2_BIB7","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1287\/mnsc.23.12.1273","article-title":"Procedures for estimating optimal solution values for large combinatorial problems","volume":"23","author":"Dannerbring","year":"1977","journal-title":"Manag. Sci."},{"key":"10.1016\/0166-218X(86)90058-2_BIB8","first-page":"180","article-title":"Limiting forms of the frequency distribution of the largest or smallest member of a sample","volume":"24","author":"Fisher","year":"1928"},{"key":"10.1016\/0166-218X(86)90058-2_BIB9","first-page":"839","article-title":"Probabilistic machines can use less running time","volume":"77","author":"Freivalds","year":"1977"},{"key":"10.1016\/0166-218X(86)90058-2_BIB10","series-title":"Dynamic weighted search for near optimal solutions to traveling salesman problems","author":"Friedenbach","year":"1974"},{"key":"10.1016\/0166-218X(86)90058-2_BIB11","article-title":"Sintesi di grafi equidistribuiti per centrali di commutazione modulari","author":"Fumagalli","year":"1982"},{"key":"10.1016\/0166-218X(86)90058-2_BIB12","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(86)90058-2_BIB13","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Computational complexity of probabilistic Turing machines","volume":"6","author":"Gill","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(86)90058-2_BIB14","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/net.3230070303","article-title":"A statistical approach to the TSP","volume":"7","author":"Golden","year":"1977","journal-title":"Networks"},{"key":"10.1016\/0166-218X(86)90058-2_BIB15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/nav.3800260108","article-title":"Interval estimation of a global optimum for large combinatorial problems","volume":"26","author":"Golden","year":"1979","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(86)90058-2_BIB16","first-page":"313","article-title":"On colouring random graphs","volume":"77","author":"Grimmett","year":"1975"},{"key":"10.1016\/0166-218X(86)90058-2_BIB17","series-title":"Algorithms and Complexity","first-page":"1","article-title":"The probabilistic analysis of some combinatorial search algorithms","author":"Karp","year":"1976"},{"key":"10.1016\/0166-218X(86)90058-2_BIB18","first-page":"291","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kerninghan","year":"1970","journal-title":"B.S.T.J."},{"key":"10.1016\/0166-218X(86)90058-2_BIB19","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/0166-218X(86)90058-2_BIB20","article-title":"Using branch-and-bound algorithms to obtain suboptimal solutions","author":"Ibaraki","year":"1981"},{"key":"10.1016\/0166-218X(86)90058-2_BIB21","article-title":"M\u00e9thodes statistiques en optimization combinatoire","volume":"116","author":"Lardinois","year":"1979"},{"key":"10.1016\/0166-218X(86)90058-2_BIB22","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0166-218X(86)90058-2_BIB23","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic for the Travelling Salesman Problem","volume":"21","author":"Lin","year":"1973","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(86)90058-2_BIB24","article-title":"On determinants, matching and random algorithms","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/0166-218X(86)90058-2_BIB25","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0095-8956(80)90066-0","article-title":"Matroid matching and some applications","volume":"28","author":"Lov\u00e1sz","year":"1980","journal-title":"J. Combin. Theory (Ser. B)"},{"key":"10.1016\/0166-218X(86)90058-2_BIB26_1","series-title":"Combinatorial Optimization: Annotated bibliographies","first-page":"89","article-title":"Randomized algorithms: an annotated bibliography","author":"Maffioli","year":"1985"},{"key":"10.1016\/0166-218X(86)90058-2_BIB26_2","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01874396","volume":"1","year":"1984","journal-title":"Annals Oper Res."},{"key":"10.1016\/0166-218X(86)90058-2_BIB27","doi-asserted-by":"crossref","first-page":"1331","DOI":"10.1287\/opre.19.6.1331","article-title":"A search model for evaluating combinatorially explosive problems","volume":"19","author":"McRoberts","year":"1971","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(86)90058-2_BIB28","article-title":"Linear matroid parity made almost easy","author":"Orlin","year":"1983"},{"key":"10.1016\/0166-218X(86)90058-2_BIB29","series-title":"Combinatorial Optimization: Complexity and Algorithms","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0166-218X(86)90058-2_BIB30","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","article-title":"Hamiltonian circuits in random graphs","volume":"14","author":"Posa","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(86)90058-2_BIB31","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"Rabin","year":"1963","journal-title":"Probabilistic automata, Information and Control"},{"key":"10.1016\/0166-218X(86)90058-2_BIB32","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","article-title":"Probabilistic algorithms for testing primality","volume":"12","author":"Rabin","year":"1980","journal-title":"J. Number Theory"},{"key":"10.1016\/0166-218X(86)90058-2_BIB33","article-title":"Probabilistic analysis of random extension-rotation algorithms","author":"Reif","year":"1981"},{"key":"10.1016\/0166-218X(86)90058-2_BIB34","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/opre.17.3.455","article-title":"Computer solutions to minimum-cover problems","volume":"17","author":"Roth","year":"1969","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(86)90058-2_BIB35","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1145\/321574.321584","article-title":"An approach to solving linear discrete optimization problems","volume":"17","author":"Roth","year":"1970","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(86)90058-2_BIB36","first-page":"704","article-title":"Probabilistic Turing machines and computability","volume":"22","author":"Santos","year":"1969"},{"key":"10.1016\/0166-218X(86)90058-2_BIB37","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1109\/TCT.1969.1083004","article-title":"The design of minimal cost survivable networks","volume":"16","author":"Steighlitz","year":"1969","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/0166-218X(86)90058-2_BIB38","article-title":"A probabilistic stopping rule for randomized algorithms","author":"Vercellis","year":"1981"},{"key":"10.1016\/0166-218X(86)90058-2_BIB39","series-title":"EUROSAM Proc.","first-page":"216","article-title":"Probabilistic algorithms for sparse polynomials","author":"Zippel","year":"1979"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X86900582?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X86900582?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T16:16:25Z","timestamp":1583511385000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X86900582"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,6]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,6]]}},"alternative-id":["0166218X86900582"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(86)90058-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1986,6]]}}}