{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T12:37:43Z","timestamp":1762173463898},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319597751"},{"type":"electronic","value":"9783319597768"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59776-8_18","type":"book-chapter","created":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T09:26:33Z","timestamp":1496136393000},"page":"221-228","source":"Crossref","is-referenced-by-count":6,"title":["A First Look at Picking Dual Variables for\u00a0Maximizing Reduced Cost Fixing"],"prefix":"10.1007","author":[{"given":"Omid Sanei","family":"Bajgiran","sequence":"first","affiliation":[]},{"given":"Andre A.","family":"Cire","sequence":"additional","affiliation":[]},{"given":"Louis-Martin","family":"Rousseau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"key":"18_CR1","unstructured":"MIPLIB2010. http:\/\/miplib.zib.de\/miplib2010-benchmark.php"},{"issue":"1","key":"18_CR2","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/mnsc.26.1.86","volume":"26","author":"E Balas","year":"1980","unstructured":"Balas, E., Martin, C.H.: Pivot and complement-a heuristic for 0\u20131 programming. Manage. Sci. 26(1), 86\u201396 (1980)","journal-title":"Manage. Sci."},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-319-23219-5_3","volume-title":"Principles and Practice of Constraint Programming","author":"D Bergman","year":"2015","unstructured":"Bergman, D., Cire, A.A., Hoeve, W.-J.: Improved constraint propagation via lagrangian decomposition. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 30\u201338. Springer, Cham (2015). doi: 10.1007\/978-3-319-23219-5_3"},{"key":"18_CR4","series-title":"IFIP\u2014The International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-0-387-35514-6_2","volume-title":"System Modelling and Optimization","author":"ER Bixby","year":"2000","unstructured":"Bixby, E.R., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: MIP: theory and practice \u2014 closing the gap. In: Powell, M.J.D., Scholtes, S. (eds.) CSMO 1999. ITIFIP, vol. 46, pp. 19\u201349. Springer, Boston, MA (2000). doi: 10.1007\/978-0-387-35514-6_2"},{"key":"18_CR5","volume-title":"Linear Programming","author":"V Chv\u00e1tal","year":"1983","unstructured":"Chv\u00e1tal, V.: Linear Programming. Freeman, New York (1983). Reprints: (1999), (2000), (2002)"},{"key":"18_CR6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1023\/A:1021193019522","volume":"115","author":"T Fahle","year":"2002","unstructured":"Fahle, T., Sellmann, M.: Cost-based filtering for the constrained knapsack problem. Ann. Oper. Res. 115, 73\u201393 (2002)","journal-title":"Ann. Oper. Res."},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-540-48085-3_14","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 1999","author":"F Focacci","year":"1999","unstructured":"Focacci, F., Lodi, A., Milano, M.: Cost-based domain filtering. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 189\u2013203. Springer, Heidelberg (1999). doi: 10.1007\/978-3-540-48085-3_14"},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S1571-0653(04)00002-2","volume":"1","author":"F Focacci","year":"1999","unstructured":"Focacci, F., Lodi, A., Milano, M., Vigo, D.: Solving TSP through the integration of OR and CP techniques. Electron. Notes Discrete Math. 1, 13\u201325 (1999)","journal-title":"Electron. Notes Discrete Math."},{"key":"18_CR9","unstructured":"Focacci, F., Milano, M., Lodi, A.: Solving TSP with time windows with constraints. In: Proceedings of the 1999 International Conference on Logic programming, Massachusetts Institute of Technology, pp. 515\u2013529 (1999)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/3-540-47867-1_27","volume-title":"Integer Programming and Combinatorial Optimization","author":"D Klabjan","year":"2002","unstructured":"Klabjan, D.: A new subadditive approach to integer programming. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol. 2337, pp. 384\u2013400. Springer, Heidelberg (2002). doi: 10.1007\/3-540-47867-1_27"},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/978-3-540-68279-0_16","volume-title":"50 Years of Integer Programming 1958\u20132008","author":"A Lodi","year":"2010","unstructured":"Lodi, A.: Mixed integer programming computation. In: J\u00fcnger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (eds.) 50 Years of Integer Programming 1958\u20132008, pp. 619\u2013645. Springer, Heidelberg (2010)"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Mahajan, A.: Presolving mixed-integer linear programs. In: Wiley Encyclopedia of Operations Research and Management Science (2010)","DOI":"10.1002\/9780470400531.eorms0437"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer Programming and Combinatorial Optimization (1988)","DOI":"10.1002\/9781118627372"},{"key":"18_CR14","unstructured":"Chichester, W., Nemhauser, G.L., Savelsbergh, M.W.P., Sigismondi, G.S.: Constraint Classification for Mixed Integer Programming Formulations. COAL Bulletin, vol. 20, pp. 8\u201312 (1992)"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-45349-0_27","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2000","author":"P Refalo","year":"2000","unstructured":"Refalo, P.: Linear formulation of constraint programming models and hybrid solvers. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 369\u2013383. Springer, Heidelberg (2000). doi: 10.1007\/3-540-45349-0_27"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-540-30201-8_46","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"M Sellmann","year":"2004","unstructured":"Sellmann, M.: Theoretical foundations of CP-based lagrangian relaxation. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 634\u2013647. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-30201-8_46"},{"issue":"1","key":"18_CR17","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1023\/A:1021136801775","volume":"115","author":"ES Thorsteinsson","year":"2002","unstructured":"Thorsteinsson, E.S., Ottosson, G.: Linear relaxations and reduced-cost based propagation of continuous variable subscripts. Ann. Oper. Res. 115(1), 15\u201329 (2002)","journal-title":"Ann. Oper. Res."},{"key":"18_CR18","volume-title":"Integer Programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming, vol. 4. Wiley, New York (1998)"},{"issue":"2","key":"18_CR19","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.1090.0733","volume":"58","author":"T Yunes","year":"2010","unstructured":"Yunes, T., Aron, I.D., Hooker, J.N.: An integrated solver for optimization problems. Oper. Res. 58(2), 342\u2013356 (2010)","journal-title":"Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59776-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T03:41:16Z","timestamp":1569382876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59776-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319597751","9783319597768"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59776-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}