{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:06:06Z","timestamp":1761807966951},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,3,27]],"date-time":"2015-03-27T00:00:00Z","timestamp":1427414400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10898-015-0294-3","type":"journal-article","created":{"date-parts":[[2015,3,27]],"date-time":"2015-03-27T02:12:57Z","timestamp":1427422377000},"page":"127-150","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["An implementation of exact knapsack separation"],"prefix":"10.1007","volume":"66","author":[{"given":"Igor","family":"Vasilyev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Boccia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sa\u00efd","family":"Hanafi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,27]]},"reference":[{"key":"294_CR1","first-page":"319","volume":"1","author":"A Ceselli","year":"2003","unstructured":"Ceselli, A.: Two exact algorithms for the capacitated p-median problem. 4OR 1, 319\u2013340 (2003)","journal-title":"4OR"},{"issue":"3","key":"294_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.20059","volume":"45","author":"A Ceselli","year":"2004","unstructured":"Ceselli, A., Righini, G.: A branch and price algorithm for the capacitated $$p$$ p -median problem. Networks 45(3), 125\u2013142 (2004)","journal-title":"Networks"},{"key":"294_CR3","doi-asserted-by":"crossref","unstructured":"Pigatti, A., Poggi de Aragao, M., Uchoa, E.: Stabilized branch-and-cut-and-price for the generalized assignment problem. In: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics. Electronic Notes in Discrete Mathematics vol. 19, pp. 389\u2013395 (2005)","DOI":"10.1016\/j.endm.2005.05.052"},{"key":"294_CR4","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s10589-008-9183-8","volume":"45","author":"P Avella","year":"2010","unstructured":"Avella, P., Boccia, M., Vasilyev, I.: A computational study of exact knapsack separation for the generalized assignment problem. Comput. Optim. Appl. 45, 543\u2013555 (2010)","journal-title":"Comput. Optim. Appl."},{"key":"294_CR5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10852-007-9074-5","volume":"7","author":"M Boccia","year":"2007","unstructured":"Boccia, M., Sforza, A., Sterle, C., Vasilyev, I.: A cut and branch approach for the capacitated $$p$$ p -median problem based on fenchel cutting planes. J. Math. Model. Algorithms 7, 43\u201358 (2007)","journal-title":"J. Math. Model. Algorithms"},{"key":"294_CR6","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1134\/S1064230709010067","volume":"48","author":"I Vasilev","year":"2009","unstructured":"Vasilev, I.: A cutting plane method for knapsack polytope. J. Comput. Syst. Sci. Int. 48, 70\u201377 (2009)","journal-title":"J. Comput. Syst. Sci. Int."},{"key":"294_CR7","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"294_CR8","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1137\/0803038","volume":"3","author":"EA Boyd","year":"1993","unstructured":"Boyd, E.A.: Generating fenchel cutting planes for knapsack polyhedra. SIAM J. Optim. 3, 734\u2013750 (1993)","journal-title":"SIAM J. Optim."},{"key":"294_CR9","first-page":"209","volume":"1993","author":"EA Boyd","year":"1993","unstructured":"Boyd, E.A.: Solving integer programs with cutting planes and preprocessing. IPCO 1993, 209\u2013220 (1993)","journal-title":"IPCO"},{"key":"294_CR10","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/opre.42.1.53","volume":"42","author":"EA Boyd","year":"1994","unstructured":"Boyd, E.A.: Fenchel cutting planes for integer programming. Oper. Res. 42, 53\u201364 (1994)","journal-title":"Oper. Res."},{"key":"294_CR11","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1137\/0805021","volume":"5","author":"EA Boyd","year":"1995","unstructured":"Boyd, E.A.: On the convergence of fenchel cutting planes in mixed-integer programming. SIAM J. Optim. 5, 421\u2013435 (1995)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"294_CR12","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s10107-009-0284-7","volume":"128","author":"R Fukasawa","year":"2011","unstructured":"Fukasawa, R., Goycoolea, M.: On the exact separation of mixed integer knapsack cuts. Math. Program. 128(1\u20132), 19\u201341 (2011)","journal-title":"Math. Program."},{"key":"294_CR13","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10107-010-0359-5","volume":"124","author":"K Kaparis","year":"2010","unstructured":"Kaparis, K., Letchford, A.N.: Separation algorithms for 0\u20131 knapsack polytopes. Math. Program. 124, 69\u201391 (2010)","journal-title":"Math. Program."},{"key":"294_CR14","unstructured":"Bonami, M.P.: \u00c9tude et mise en oeuvre dapproches poly\u00e9driques pour la r\u00e9solution de programmes en nombres entiers ou mixtes g\u00e9n\u00e9raux. Ph.D. thesis, L\u2019Universit\u00e9 Paris 6 (2003)"},{"key":"294_CR15","unstructured":"Espinoza, D.G.: On Linear Programming, Integer Programming and Cutting Planes. PhD thesis, Georgia Institute of Technology, School of Industrial and Systems Engineering (2006)"},{"issue":"1","key":"294_CR16","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1287\/ijoc.1100.0441","volume":"24","author":"P Avella","year":"2012","unstructured":"Avella, P., Boccia, M., Vasilyev, I.: Computational testing of a separation procedure for the knapsack set with a single continuous variable. INFORMS J. Comput. 24(1), 165\u2013171 (2012)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"294_CR17","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.orl.2008.09.009","volume":"37","author":"P Avella","year":"2009","unstructured":"Avella, P., Boccia, M., Vasilyev, I.: Computational experience with general cutting planes for the set covering problem. Oper. Res. Lett. 37(1), 16\u201320 (2009)","journal-title":"Oper. Res. Lett."},{"key":"294_CR18","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-003-0440-4","volume":"97","author":"D Applegate","year":"2003","unstructured":"Applegate, D., Bixby, R., Chvatal, V., Cook, W.: Implementing the dantzig\u2013fulkerson\u2013johnson algorithm for large traveling salesman problems. Math. Program. 97, 91\u2013153 (2003)","journal-title":"Math. Program."},{"key":"294_CR19","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841103","volume-title":"The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)","author":"DL Applegate","year":"2007","unstructured":"Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics). Princeton University Press, Princeton (2007)"},{"issue":"3","key":"294_CR20","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s10107-005-0670-8","volume":"106","author":"G Cornuejols","year":"2006","unstructured":"Cornuejols, G., Lemarechal, C.: A convex-analysis perspective on disjunctive cuts. Math. Program. 106(3), 567\u2013586 (2006)","journal-title":"Math. Program."},{"key":"294_CR21","first-page":"758","volume":"46","author":"D Pisinger","year":"1995","unstructured":"Pisinger, D.: A minimal algorithm for the 0\u20131 knapsack problem. Oper. Res. 46, 758\u2013767 (1995)","journal-title":"Oper. Res."},{"key":"294_CR22","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2005","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2005)"},{"key":"294_CR23","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, London (1990)"},{"key":"294_CR24","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s10589-011-9432-0","volume":"52","author":"M Posta","year":"2012","unstructured":"Posta, M., Ferland, J.A., Michelon, P.: An exact method with variable fixing for solving the generalized assignment problem. Comput. Optim. Appl. 52, 629\u2013644 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"11","key":"294_CR25","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: Or-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"294_CR26","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1287\/inte.9.4.12","volume":"9","author":"F Glover","year":"1979","unstructured":"Glover, F., Hultz, J., Klingman, D.: Improved computer-based planning techniques. part ii. Interfaces 9(4), 12\u201320 (1979)","journal-title":"Interfaces"},{"key":"294_CR27","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1017900606269","volume":"8","author":"AP French","year":"2002","unstructured":"French, A.P., Wilson, J.M.: Heuristic solution methods for the multilevel generalized assignment problem. J. Heuristics 8, 143\u2013153 (2002)","journal-title":"J. Heuristics"},{"issue":"1","key":"294_CR28","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/0377-2217(93)E0174-V","volume":"82","author":"M Laguna","year":"1995","unstructured":"Laguna, M., Kelly, J.P., Gonzlez-Velarde, J.L., Glover, F.: Tabu search for the multilevel generalized assignment problem. Eur. J. Oper. Res. 82(1), 176\u2013189 (1995)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"294_CR29","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/S0377-2217(02)00576-3","volume":"151","author":"MA Osorio","year":"2003","unstructured":"Osorio, M.A., Laguna, M.: Logic cuts for multilevel generalized assignment problems. Eur. J. Oper. Res. 151(1), 238\u2013246 (2003)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"294_CR30","doi-asserted-by":"crossref","first-page":"1172","DOI":"10.1287\/opre.1060.0323","volume":"54","author":"A Ceselli","year":"2006","unstructured":"Ceselli, A., Righini, G.: A branch-and-price algorithm for the multilevel generalized assignment problem. Oper. Res. 54(6), 1172\u20131184 (2006)","journal-title":"Oper. Res."},{"key":"294_CR31","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0305-0548(00)00072-1","volume":"29","author":"R Baldacci","year":"2002","unstructured":"Baldacci, R., Hadjiconstantinou, E., Maniezzo, V., Mingozzi, A.: A new method for solving capacitated location problems based on a set partitioning approach. Comput. Oper. Res. 29, 365\u2013386 (2002)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"294_CR32","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1016\/S0305-0548(03)00039-X","volume":"31","author":"L Lorena","year":"2004","unstructured":"Lorena, L., Senne, E.: A column generation approach to capacitated p-median problems. Comput. Oper. Res. 31(6), 863\u2013876 (2004)","journal-title":"Comput. Oper. Res."},{"key":"294_CR33","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s10479-008-0375-5","volume":"167","author":"A Ceselli","year":"2009","unstructured":"Ceselli, A., Liberatore, Federico, Righini, Giovanni: A computational evaluation of a general branch-and-price framework for capacitated network location problems. Ann. Oper. Res. 167, 209\u2013251 (2009)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"294_CR34","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1016\/S0377-2217(98)00008-3","volume":"113","author":"K Holmberg","year":"1999","unstructured":"Holmberg, K., Rnnqvist, M., Yuan, D.: An exact algorithm for the capacitated facility location problems with single sourcing. Eur. J. Oper. Res. 113(3), 544\u2013559 (1999)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"294_CR35","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1057\/palgrave.jors.2601353","volume":"53","author":"JA Daz","year":"2002","unstructured":"Daz, J.A., Fernndez, E.: A branch-and-price algorithm for the single source capacitated plant location problem. J. Oper. Res. Soc. 53(7), 728\u2013740 (2002)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"294_CR36","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., More, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0294-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-015-0294-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0294-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T05:36:57Z","timestamp":1598852217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-015-0294-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,27]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["294"],"URL":"https:\/\/doi.org\/10.1007\/s10898-015-0294-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,27]]}}}