{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:47:10Z","timestamp":1725497230551},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729594"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72960-0_21","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T10:25:48Z","timestamp":1196936748000},"page":"439-474","source":"Crossref","is-referenced-by-count":4,"title":["Inequalities and Target Objectives for Metaheuristic Search \u2013 Part I: Mixed Binary Optimization"],"prefix":"10.1007","author":[{"given":"Fred","family":"Glover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/0123007","volume":"23","author":"ER Balas Jeroslow","year":"1972","unstructured":"Balas E Jeroslow R (1972) Canonical Cuts on the Unit Hypercube. SIAM Journal of Applied Mathematics, 23(1):60\u201369","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"21_CR2","volume-title":"Linear Programming and Extensions","author":"G Dantzig","year":"1963","unstructured":"Dantzig G (1963) Linear Programming and Extensions. Princeton University Press, Princeton, NJ."},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1023\/A:1023717307746","volume":"9","author":"TPLB Davoine Hammer Vizvi\u00e1ri","year":"2003","unstructured":"Davoine T Hammer PL Vizvi\u00e1ri B (2003). A\u00a0Heuristic for Boolean Optimization Problems. Journal of Heuristics 9:229\u2013247","journal-title":"Journal of Heuristics"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"MFA Fischetti Glover Lodi","year":"2005","unstructured":"Fischetti M Glover F Lodi A\u00a0(2005) Feasibility Pump. Mathematical Programming \u2013 Series A\u00a0104:91\u2013104","journal-title":"Mathematical Programming \u2013 Series A"},{"issue":"2","key":"21_CR5","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0305-0483(78)90022-1","volume":"6","author":"F Glover","year":"1978","unstructured":"Glover F (1978) Parametric Branch and Bound. OMEGA, The International Journal of Management Science 6(2):145\u2013152","journal-title":"OMEGA, The International Journal of Management Science"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Glover F (2005) Adaptive Memory Projection Methods for Integer Programming. In: Rego C Alidaee B (eds) Metaheuristic Optimization Via Memory and Evolution: Tabu Search and Scatter Search. Kluwer Academic Publishers.","DOI":"10.1007\/0-387-23667-8_19"},{"issue":"9","key":"21_CR7","doi-asserted-by":"publisher","first-page":"2449","DOI":"10.1016\/j.cor.2005.07.009","volume":"33","author":"F Glover","year":"2006","unstructured":"Glover F (2006) Parametric Tabu Search for Mixed Integer Programs. Computers and Operations Research 33(9):2449\u20132494","journal-title":"Computers and Operations Research"},{"key":"21_CR8","unstructured":"Glover F (2006a) Satisfiability Data Mining for Binary Data Classification Problems. Research Report, University of Colorado, Boulder"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Glover F (2007) Infeasible\/Feasible Search Trajectories and Directional Rounding in Integer Programming. Journal of Heuristics, Kluwer Publishing (to appear)","DOI":"10.1007\/s10732-007-9029-z"},{"issue":"2","key":"21_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0377-2217(89)90185-9","volume":"39","author":"FH Glover Greenberg","year":"1989","unstructured":"Glover F Greenberg H (1989) New Approaches for Heuristic Search: A\u00a0Bilateral Linkage with Artificial Intelligence. European Journal of Operational Research 39(2):119\u2013130","journal-title":"European Journal of Operational Research"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Glover F Laguna M (1997) Tabu Search. Kluwer Academic Publishers","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0167-6377(03)00014-2","volume":"31","author":"FHD Glover Sherali","year":"2003","unstructured":"Glover F Sherali HD (2003) Foundation-Penalty Cuts for Mixed-Integer Programs. Operations Research Letters 31:245\u2013253","journal-title":"Operations Research Letters"},{"key":"21_CR13","unstructured":"Guignard M Spielberg K (2003) Double Contraction, Double Probing, Short Starts and BB-Probing Cuts for Mixed (0,1) Programming. Wharton School Report"},{"key":"21_CR14","unstructured":"Hanafi S Wilbaut C (2006) Improved Convergent Heuristic for 0\u20131 Mixed Integer Programming. Research Report, University of Valenciennes"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.dam.2003.06.006","volume":"142","author":"LMAF Hvattum L\u00fbkketangen Glover","year":"2004","unstructured":"Hvattum LM L\u00fbkketangen A\u00a0Glover F (2004) Adaptive Memory Search for Boolean Optimization Problems. Discrete Applied Mathematics 142:99\u2013109","journal-title":"Discrete Applied Mathematics"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Nediak M Eckstein J (2007) Pivot, Cut, and Dive: A\u00a0Heuristic for Mixed 0\u20131 Integer Programming. Journal of Heuristics, Kluwer Publishing (to appear)","DOI":"10.1007\/s10732-007-9021-7"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Pardalos PS Shylo OV (2006) An Algorithm for Job Shop Scheduling based on Global Equilibrium Search Techniques. Computational Management Science (Published online), DOI: 10.1007\/s10287-006-0023-y","DOI":"10.1007\/s10287-006-0023-y"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s10107-006-0009-0","volume":"110","author":"JJW Patel Chinneck","year":"2007","unstructured":"Patel J Chinneck JW (2007) Active-Constraint Variable Ordering for Faster Feasibility of Mixed Integer Linear Programs. Mathematical Programming Series A, 110:445\u2013474","journal-title":"Mathematical Programming Series A"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Pedroso JP (2005) Tabu Search for Mixed Integer Programming. In: Rego C Alidaee B (eds) Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search. Kluwer Academic Publishers","DOI":"10.1007\/0-387-23667-8_11"},{"key":"21_CR20","first-page":"74","volume":"1","author":"OV Shylo","year":"1999","unstructured":"Shylo OV (1999) A\u00a0Global Equilibrium Search Method. (Russian) Kybernetika I Systemniy Analys 1:74\u201380","journal-title":"(Russian) Kybernetika I Systemniy Analys"},{"issue":"3","key":"21_CR21","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0377-2217(78)90093-0","volume":"2","author":"ALBW Soyster Lev Slivka","year":"1978","unstructured":"Soyster AL Lev B Slivka W (1978) Zero\u2013One Programming with Many Variables and Few Constraints. European Journal of Operational Research 2(3):195\u2013201","journal-title":"European Journal of Operational Research"},{"key":"21_CR22","unstructured":"Spielberg K Guignard M (2000) A\u00a0Sequential (Quasi) Hot Start Method for BB (0,1) Mixed Integer Programming. Mathematical Programming Symposium, Atlanta"},{"key":"21_CR23","unstructured":"Ursulenko A\u00a0(2006) Notes on the Global Equilibrium Search. Working paper, Texas A&M University"},{"key":"21_CR24","unstructured":"Wilbaut C Hanafi S (2006) New Convergent Heuristics for 0\u20131 Mixed Integer Programming. Research Report, University of Valenciennes"}],"container-title":["Natural Computing Series","Advances in Metaheuristics for Hard Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72960-0_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:52:21Z","timestamp":1619502741000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72960-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540729594"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72960-0_21","relation":{},"subject":[]}}