{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:06:46Z","timestamp":1725548806421},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,11,1]],"date-time":"2005-11-01T00:00:00Z","timestamp":1130803200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2005,11]]},"DOI":"10.1007\/s10479-005-3973-5","type":"journal-article","created":{"date-parts":[[2005,11,26]],"date-time":"2005-11-26T12:12:53Z","timestamp":1133007173000},"page":"235-261","source":"Crossref","is-referenced-by-count":12,"title":["\u201cMiniaturized\u201d Linearizations for Quadratic 0\/1 Problems"],"prefix":"10.1007","volume":"140","author":[{"given":"Serigne","family":"Gueye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Michelon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3973_CR1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0166-218X(90)90139-4","volume":"29","author":"W. Adams","year":"1990","unstructured":"Adams, W., A. Billionnet, and A. Sutter. (1990). \u201cUnconstrained 0-1 Optimization and Lagrangean Relaxation.\u201d Discrete Applied Mathematics 29, 131\u2013142.","journal-title":"Discrete Applied Mathematics"},{"key":"3973_CR2","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1080\/00207729408928968","volume":"25","author":"B. Alidaee","year":"1994","unstructured":"Alidaee, B., G. Kochenberger, and A. Ahmadian. (1994). \u201c0-1 Quadratic Programming Approach for the Optimal Solution of Two Scheduling Problems.\u201d International Journal of System Science 25, 401\u2013408.","journal-title":"International Journal of System Science"},{"key":"3973_CR3","unstructured":"Beasley, J.E. (1998). \u201cHeuristic Algorithms for the Unconstrained Binary Quadratic Programming Problem.\u201d Technical report, Department of Mathematics, Imperial College of Science and Technology, London, England."},{"key":"3973_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02591796","volume":"30","author":"E. Balas","year":"1984","unstructured":"Balas, E. and J.B. Mazzola. (1984). \u201cNon-Linear 0-1 Programming i : Linearization Techniques.\u201d Mathematical Programming 30, 1\u201321.","journal-title":"Mathematical Programming"},{"key":"3973_CR5","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/0377-2217(94)90125-2","volume":"78","author":"A. Billionnet","year":"1994","unstructured":"Billionnet, A. and A. Sutter. (1994). \u201cMinimization of a Quadratic Pseudo-Boolean Function.\u201d European Journal of Operational Research 78, 106\u2013115.","journal-title":"European Journal of Operational Research"},{"key":"3973_CR6","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1016\/S0305-0548(99)00071-4","volume":"27","author":"C.T. Chang","year":"2000","unstructured":"Chang, C.T. and C.C. Chang. (2000). \u201cA Linearization Method for Mixed 0-1 Polynomial Programs.\u201d Computers and Operations Research 27, 1005\u20131016.","journal-title":"Computers and Operations Research"},{"issue":"4","key":"3973_CR7","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1287\/mnsc.41.4.704","volume":"41","author":"P. Chardaire","year":"1995","unstructured":"Chardaire, P. and A. Sutter. (1995). \u201cA Decomposition method for Quadratic Zero-One Programming.\u201d Management Science 41(4), 704\u2013712.","journal-title":"Management Science"},{"key":"3973_CR8","unstructured":"Djabali, R. (1998). Optimisation non lin\u00e9aire en variables bivalentes et applications. Th\u00e8se de doctorat, CNAM."},{"issue":"2","key":"3973_CR9","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01580897","volume":"56","author":"M. Deza","year":"1992a","unstructured":"Deza, M. and M. Laurent. (1992a). \u201cFacets for the Cut Cone I.\u201d Mathematical Programming 56(2), 121\u2013160.","journal-title":"Mathematical Programming"},{"issue":"2","key":"3973_CR10","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01580898","volume":"56","author":"M. Deza","year":"1992b","unstructured":"Deza, M. and M. Laurent. (1992b). \u201cFacets for the Cut Cone II.\u201d Mathematical Programming 56(2), 161\u2013188.","journal-title":"Mathematical Programming"},{"key":"3973_CR11","unstructured":"Fiduccia, C. and R. Mattheyses. (1982). \u201cA Linear-Time Heuristic for Improving Network Partitions.\u201d In ACM\/IEEE 19th Design Autom. Conference, Las Vegas, 175\u2013181."},{"key":"3973_CR12","first-page":"5","volume":"1","author":"R. Fortet","year":"1959","unstructured":"Fortet, R. (1959). \u201cL'alg\u00e8bre De Boole et ses Applications En Recherche Op\u00e9rationnelle.\u201d Cahier du Centre d'Etudes de Recherche Op\u00e9rationnelle 1, 5\u201336.","journal-title":"Cahier du Centre d'Etudes de Recherche Op\u00e9rationnelle"},{"key":"3973_CR13","first-page":"17","volume":"4","author":"R. Fortet","year":"1960","unstructured":"Fortet, R. (1960). \u201cApplication De L'alg\u00e8bre De Boole En Recherche Op\u00e9rationnelle.\u201d Revue Fran\u00e7aise de Recherche Op\u00e9rationnelle 4, 17\u201326.","journal-title":"Revue Fran\u00e7aise de Recherche Op\u00e9rationnelle"},{"key":"3973_CR14","unstructured":"Garey, M. and D. Johnson. (1979). Computers and Intractibility: A Guide to the Theory of NP-Completeness. W.H. Freeman & Company."},{"key":"3973_CR15","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1287\/mnsc.44.3.336","volume":"44","author":"F. Glover","year":"1998","unstructured":"Glover, F., G.A. Kochenberger, and B. Alidaee. (1998). \u201cAdaptative Memory Tabu Search for Binary Quadratic Programs.\u201d Management Science 44, 336\u2013345.","journal-title":"Management Science"},{"issue":"4","key":"3973_CR16","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/mnsc.22.4.455","volume":"22","author":"F. Glover","year":"1975","unstructured":"Glover, F. (1975). \u201cImproved Linear Integer Programming Formulations of Nonlinear Integer Problems.\u201d Management Science 22(4), 455\u2013460.","journal-title":"Management Science"},{"key":"3973_CR17","unstructured":"Gueye, S. (2002). Lin\u00e9arisation et relaxation lagrangienne pour probl\u00e8mes quadratiques en variables binaires. Th\u00e8se de doctorat, Universit\u00e9 d'Avignon."},{"issue":"3","key":"3973_CR18","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01580072","volume":"82","author":"C. Helmberg","year":"1998","unstructured":"Helmberg, C. and F. Rendl. (1998). \u201cSolving Quadratic (0,1)-Problems by Semidefinite Programs and Cutting Planes.\u201d Mathematical Programming 82(3), 291\u2013315.","journal-title":"Mathematical Programming"},{"key":"3973_CR19","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"D. Johnson","year":"1989","unstructured":"Johnson, D., C. Aragon, L. McGeoch, and C. Schevon. (1989). \u201cOptimization by Simulated Annealing: An Experimental Evaluation: Part i, Graph Partitioning.\u201d Operations Research 37, 865\u2013892.","journal-title":"Operations Research"},{"key":"3973_CR20","volume-title":"Introduction to parallel computing: design and analysis of algorithms","author":"V. Kumar","year":"1994","unstructured":"Kumar, V., A. Grama, A. Gupta, and G. Karypis. (1994). Introduction to parallel computing: design and analysis of algorithms. Benjamin\/Cummings Publishing Company, Redwood City, CA."},{"key":"3973_CR21","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan, B.W. and S. Lin. (1970). \u201cAn Efficient Heuristic Procedure for Partitioning Graphs.\u201d Bell Systems Technical Journal 49, 291\u2013307.","journal-title":"Bell Systems Technical Journal"},{"key":"3973_CR22","unstructured":"Kuznar, R. (1996). Partitioning and optimization of digital integrated circuits. Doctoral thesis, University of Ljubljana, Faculty of Electrical Engineering, Ljubljana, Slovenia."},{"key":"3973_CR23","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1016\/S0377-2217(98)00359-2","volume":"119","author":"A. Lodi","year":"1999","unstructured":"Lodi, A., K. Allemand, and T.M. Liebling. (1999). \u201cAn Evolutionary Heuristic for Quadratic 0-1 Programming.\u201d European Journal of Operational Research 119, 662\u2013670.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"3973_CR24","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1287\/opre.42.4.677","volume":"42","author":"M. Laguna","year":"1994","unstructured":"Laguna, M., T.A. Feo, and H.C. Herold. (1994). \u201cA Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem.\u201d Operations Research 42(4), 677\u2013687.","journal-title":"Operations Research"},{"issue":"2","key":"3973_CR25","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1017912624016","volume":"8","author":"P. Merz","year":"2002","unstructured":"Merz, P. and B. Freisleben (2002). \u201cGreedy and Local Search Heuristics for Unconstrained Quadratic Programming.\u201d Journal of Heuristics 8(2), 197\u2013213.","journal-title":"Journal of Heuristics"},{"key":"3973_CR26","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF00122052","volume":"2","author":"P. Michelon","year":"1992","unstructured":"Michelon, P. (1992). \u201cUnconstrained Non-Linear 0-1 Programming: A Non differentiable Approach.\u201d The Journal of Global Optimization 2, 155\u2013165.","journal-title":"The Journal of Global Optimization"},{"key":"3973_CR27","unstructured":"Michelon, P., S. Ripeau, and N. Maculan. (1995). \u201cUn Algorithme pour La Bipartition D'un Graphe En Sous Graphes De Cardinalit\u00e9 fix\u00e9e.\u201d In FRANCORO I."},{"key":"3973_CR28","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"M. Padberg","year":"1989","unstructured":"Padberg, M. (1989). \u201cThe Boolean Quadric Polytope: Some Characteristics, Facets and Relatives.\u201d Mathematical Programming 45, 139\u2013172.","journal-title":"Mathematical Programming"},{"issue":"1","key":"3973_CR29","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01100205","volume":"7","author":"S. Poljak","year":"1995","unstructured":"Poljak, S., F. Rendl, and H. Wolkowicz. (1995). \u201cA Recipe for Semidefinite relaxation for (0,1)-Quadratic Programming.\u201d Journal of Global Optimization 7(1), 51\u201373.","journal-title":"Journal of Global Optimization"},{"key":"3973_CR30","volume-title":"Computer Science and Operations Research: New Developments in their Interfaces","author":"E. Rolland","year":"1992","unstructured":"Rolland E. and H. Pirkul. (1992). \u201cHeuristic Solution Procedures for the Graph Partitioning Problem.\u201d In S. Zenios, O. Balci, and R. Sharda (eds.), Computer Science and Operations Research: New Developments in their Interfaces. Pergamon Press, Oxford."},{"key":"3973_CR31","doi-asserted-by":"crossref","unstructured":"Sherali, H.D. and W.P. Adams. (1999). A Reformulation Linearization Technique for Solving Discrete and Continous Nonconvex Problems. Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4757-4388-3"},{"key":"3973_CR32","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0012-365X(90)90056-N","volume":"79","author":"C. De Simone","year":"1989","unstructured":"De Simone, C. (1989). \u201cThe Cut Polytope and Boolean Quadric Polytope.\u201d Discrete Mathematics 79, 71\u201375.","journal-title":"Discrete Mathematics"},{"key":"3973_CR33","unstructured":"Soutif, E. (2000). R\u00e9solution du probl\u00e8me quadratique en variables bivalentes. Th\u00e8se de doctorat, CNAM."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-3973-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-005-3973-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-3973-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:59:35Z","timestamp":1559152775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-005-3973-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["3973"],"URL":"https:\/\/doi.org\/10.1007\/s10479-005-3973-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,11]]}}}