{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T16:17:11Z","timestamp":1780589831767,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":67,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540428770","type":"print"},{"value":"9783540455868","type":"electronic"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45586-8_5","type":"book-chapter","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T01:06:11Z","timestamp":1180314371000},"page":"157-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Elf","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carsten","family":"Gutwenger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giovanni","family":"Rinaldi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,11,19]]},"reference":[{"key":"5_CR1","unstructured":"ABACUS 2.3: User\u2019s guide and reference manual. Oreas GmbH, 1999."},{"key":"5_CR2","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: TSP-solver \u201cConcorde\u201d. at \n                  http:\/\/www.keck.caam.rice.edu\/concorde.html\n                  \n                , 1999."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Applegate, D., Cook, W.: Solving large-scale matching problems. Network Flows and Matching, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 12, Johnson, D.S., McGeoch, C.C., eds., pp. 557\u2013576, 1993.","DOI":"10.1090\/dimacs\/012\/22"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6377(96)00007-7","volume":"19","author":"E. Balas","year":"1996","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G., Natraj, N.R.: Gomory cuts revisited. Operations Research Letters 19, 1\u201310, 1996.","journal-title":"Operations Research Letters"},{"key":"5_CR5","first-page":"361","volume-title":"The traveling salesman Problem","author":"E. Balas","year":"1985","unstructured":"Balas, E., Toth, P.: Branch and bound methods, in E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys (eds.), The traveling salesman Problem. John Wiley & Sons, Chichester, 361\u2013401, 1985."},{"key":"5_CR6","unstructured":"Balinski, M. L.: Mathematical Programming: Journal, Society, Recollections. in: Lenstra et al. (eds.) History ofmathematical programming, CWI North-Holland, 5\u201318, 1991."},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0167-6377(83)90016-0","volume":"2","author":"F. Barahona","year":"1983","unstructured":"Barahona, F.: The max-cut problem on graphs not contractible to K5. Operations Research Letters 2, 107\u2013111, 1983.","journal-title":"Operations Research Letters"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01580600","volume":"70","author":"F. Barahona","year":"1993","unstructured":"Barahona, F.: On cuts and matchings in planar graphs. Mathematical Programming 70, 53\u201368, 1993.","journal-title":"Mathematical Programming"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1287\/opre.36.3.493","volume":"36","author":"F. Barahona","year":"1988","unstructured":"Barahona, F., Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: An application ofcombinatorial optimization to statistical physics and circuit layout design. Operations Research 36, 493\u2013513, 1988.","journal-title":"Operations Research"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"F. Barahona","year":"1986","unstructured":"Barahona, F., Mahjoub, A.R.: On the cut polytope. Mathematical Programming 36, 157\u2013173, 1986.","journal-title":"Mathematical Programming"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1287\/moor.18.1.245","volume":"18","author":"E. Boros","year":"1993","unstructured":"Boros, E., Hammer, P.L. Cut-polytopes, boolean quadric polytopes and nonnegative quadratic pseudo-boolean functions. Mathematics of Operations Research 18, 245\u2013253, 1993.","journal-title":"Mathematics of Operations Research"},{"key":"5_CR12","unstructured":"Caprara, A., Fischetti, M.: Branch-and-cut algorithms. in: Dell'Amico, M. et al. (eds.), Annotated bibliographies in combinatorial optimization, Wiley, 45\u201364, 1997."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Charnes, A., Cooper, W.W., Mellon, B.: Blending aviation gasoline \u2014 A study ofprogramming interdependent activities in an integrated oil company. Econometrica 20, 1952.","DOI":"10.2307\/1907844"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.W.: Scheduling ofv ehicles from a central depot to a number ofdeliv ery points. Operations Research 12, 568\u2013581, 1964.","journal-title":"Operations Research"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Christof, T., Reinelt, G.: Algorithmic aspects of using small instance relaxations in parallel branch and cut. Technical Report, to appear in Algorithmica, 2001.","DOI":"10.1007\/s00453-001-0029-3"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Christof, T.: Low-Dimensional 0\/1-Polytopes and Branch-and-Cut in Combinatorial Optimization. Doctoral Thesis, Universit\u00e4t Heidelberg, 1997.","DOI":"10.1007\/BF02568602"},{"key":"5_CR17","unstructured":"Clochard, J.M., Naddef, D.: Using path inequalities in an branch and cut code for the symmetric traveling salesman problem. in: G. Rinaldi and L. Wolsey (eds.), Proceedings ofthe Third IPCO Conference, 291\u2013311, 1993."},{"key":"5_CR18","unstructured":"Cordier, C., Marchand, H., Laundy, R., Wolsey, L.A.: bc-opt: a branch-andcut code for mixed integer programs. Discussion Paper CORE-9778, Universit\u00e9 Catholique de Louvain, 1997."},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, 1963.","DOI":"10.7249\/R366"},{"key":"5_CR20","first-page":"393","volume":"2","author":"G.B. Dantzig","year":"1954","unstructured":"Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.: Solution ofa large scale traveling salesman problem. Operations Research 2, 393\u2013410, 1954.","journal-title":"Operations Research"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"767","DOI":"10.2307\/1911818","volume":"29","author":"G.B. Dantzig","year":"1961","unstructured":"Dantzig, G.B., Wolfe, P.: The Decomposition Algorithm for Linear Programs. Econometrica, 29:767\u2013778, 1961.","journal-title":"Econometrica"},{"key":"5_CR22","unstructured":"Deza, M., Laurent, M.: Cut Polyhedra and Metrics. LIENS-Ecole Normale Sup\u00e9rieure, 1996."},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1080\/10556789408805564","volume":"3","author":"C. Simone De","year":"1994","unstructured":"De Simone, C., Rinaldi, G.: A cutting plane algorithm for the max-cut problem. Optimization Methods and Software 3, 195\u2013214, 1994.","journal-title":"Optimization Methods and Software"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/BF02178370","volume":"80","author":"C. Simone De","year":"1995","unstructured":"De Simone, C., Diehl, M., J\u00fcnger, M., Mutzel, P., Reinelt, G., Rinaldi, G.: Exact ground states in spin glasses: New experimental results with a branchand-cut algorithm. Journal of Statistical Physics 80, 487\u2013496, 1995.","journal-title":"Journal of Statistical Physics"},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1007\/BF02174135","volume":"84","author":"C. Simone De","year":"1996","unstructured":"De Simone, C., Diehl, M., J\u00fcnger, M., Mutzel, P., Reinelt, G., Rinaldi, G.: Exact ground states of2-dimensional +-J Ising spin glasses. Journal ofStatistical Physics 84, 1363\u20131371, 1996.","journal-title":"Journal ofStatistical Physics"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"D. E.W","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Mathematik 1, 269\u2013271, 1959.","journal-title":"Numerische Mathematik"},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees and flowers. Canadian Journal of Mathematics 17, 449\u2013467, 1965.","journal-title":"Canadian Journal of Mathematics"},{"key":"5_CR28","unstructured":"Elf, M., J\u00fcnger, M., Rinaldi, G.: Minimizing Breaks by Maximizing Cuts. Technical Report (zpr2001-409), Universit\u00e4t zu K\u00f6ln, 2001"},{"key":"5_CR29","unstructured":"Felici, G., Gentile, C., Rinaldi, G.: Solving Large MIP Models in Supply Chain Management by Branch & Cut. IASI-CNR Research Report n. 522, 2000."},{"key":"5_CR30","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P.C. Gilmore","year":"1961","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Operations Research 9, 849\u2013859, 1961.","journal-title":"Operations Research"},{"key":"5_CR31","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"R.E. Gomory","year":"1958","unstructured":"Gomory, R.E.: Outline ofan algorithm for integer solutions to linear programs. Bulletin ofthe American Mathematical Society 64, 275\u2013278, 1958.","journal-title":"Bulletin ofthe American Mathematical Society"},{"key":"5_CR32","first-page":"551","volume":"9","author":"R.E. Gomory","year":"1961","unstructured":"Gomory, R.E., Hu, T.C.: Multiterminal network flows. SIAM Journal 9, 551\u2013570, 1961.","journal-title":"SIAM Journal"},{"key":"5_CR33","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: A cutting plane algorithm for the linear ordering problem. Operations Research 32, 1195\u20131220, 1984.","journal-title":"Operations Research"},{"key":"5_CR34","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF02592086","volume":"72","author":"M. Gr\u00f6tschel","year":"1996","unstructured":"Gr\u00f6tschel, M., Martin, A., Weismantel, R.: Packing Steiner trees: A cutting plane algorithm and computational results. Mathematical Programming 72, 125\u2013145, 1996.","journal-title":"Mathematical Programming"},{"key":"5_CR35","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF01584376","volume":"33","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"Gr\u00f6tschel, M., Holland, O.: Solving matching problems with linear Programming. Mathematical Programming 33, 243\u2013259, 1985","journal-title":"Mathematical Programming"},{"key":"5_CR36","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"4","author":"M. Gr\u00f6otschel","year":"1981","unstructured":"Gr\u00f6otschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 4, 169\u2013197, 1981.","journal-title":"Combinatorica"},{"key":"5_CR37","unstructured":"Henz, M.: Scheduling a major college basketball conference-revisited. Technical Note, School of Computing, National University of Singapore, 1999"},{"key":"5_CR38","unstructured":"J\u00fcnger, M., Reinelt, G., Rinaldi, G.: The Traveling Salesman Problem. in: Ball, M. et al. (eds.) Network Models,Handbook on operations research and management sciences, Vol. 7, North Holland, Amsterdam, pp. 225\u2013330, 1995."},{"key":"5_CR39","unstructured":"J\u00fcnger, M., Reinelt, G., Rinaldi, G.: Lifting and separation procedures for the cut polytope. Technical Report, Universit\u00e4t zu K\u00f6ln, in preparation."},{"key":"5_CR40","unstructured":"J\u00fcnger, M., Reinelt, G., Thienel, S.: Practical problem solving with cutting plane algorithms in combinatorial optimization.in: Cook, W. et al. (eds.) Combinatorial Optimization,DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, pp.111\u2013152, 1995."},{"key":"5_CR41","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/s004539910009","volume":"26","author":"G. J\u00fcnger","year":"2000","unstructured":"J\u00fcnger, G., Rinaldi, G., Thienel, S.: Practical performance of efficient minimum cut algorithms. Algorithmica 26, 172\u2013195, 2000.","journal-title":"Algorithmica"},{"key":"5_CR42","first-page":"183","volume":"40","author":"M. J\u00fcnger","year":"1994","unstructured":"J\u00fcnger, M., Reinelt, G., Thienel, S.: Provably good solutions for the traveling salesman problem. Zeitschrift f\u00fcr Operations Research 40, 183\u2013217, 1994.","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"5_CR43","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T","volume":"30","author":"M. J\u00fcnger","year":"2000","unstructured":"J\u00fcnger, M., Thienel, S.: The ABACUS System for Branch and Cut and Price Algorithms in Integer Programming and Combinatorial Optimization. Software Practice and Experience 30, 1325\u20131352, 2000.","journal-title":"Software Practice and Experience"},{"key":"5_CR44","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1137\/0211053","volume":"11","author":"R.M. Karp","year":"1982","unstructured":"Karp, R.M., Papadimitriou, C.H.: On linear characterizations of combinatorial optimization problems. SIAM Journal on Computing 11, 620\u2013632, 1982.","journal-title":"SIAM Journal on Computing"},{"key":"5_CR45","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7, 48\u201350, 1956.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"5_CR46","doi-asserted-by":"publisher","first-page":"493","DOI":"10.2307\/1910129","volume":"28","author":"A.H. Land","year":"1960","unstructured":"Land, A.H., Doig, A.G.: An automatic method for solving discrete programming problems. Econometrica 28, 493\u2013520, 1960.","journal-title":"Econometrica"},{"key":"5_CR47","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effiective heuristic algorithm for the traveling salesman problem.Operations Research 21, 498\u2013516, 1973.","journal-title":"Operations Research"},{"key":"5_CR48","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01581259","volume":"58","author":"D. Naddef","year":"1993","unstructured":"Naddef, D., Rinaldi, G.: The graphical relaxation: A new framework for the symmetric traveling salesman polytope. Mathematical Programming 58, 53\u201388, 1993.","journal-title":"Mathematical Programming"},{"key":"5_CR49","unstructured":"Naddef, D., Thienel, S.: Efficient Separation Routines for the Symmetric Traveling Salesman-Problem I: General Tools and Comb Separation. Technical Report99-376, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, 1999, to appear in Mathematical Programming."},{"key":"5_CR50","unstructured":"Naddef, D., Thienel, S.: Efficient Separation Routines for the Symmetric Traveling Salesman-Problem II: Separating multi Handle Inequalities. Technical Report 99-377, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, 1999, to appear in Mathematical Programming."},{"key":"5_CR51","unstructured":"Naddef, D.: The Traveling Salesman Problem and its Variations, Chapter 2, Gutin, G. and Punnen, A. (eds.), Kluwer Academic Press, to appear."},{"key":"5_CR52","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","volume":"15","author":"G.L. Nemhauser","year":"1994","unstructured":"Nemhauser, G.L., Savelsbergh, M.W.P., Sigismondi, G.C.: MINTO, a Mixed Integer Optimizer. Operations Research Letters 15, 47\u201358, 1994.","journal-title":"Operations Research Letters"},{"key":"5_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/opre.46.1.1","volume":"46","author":"G. L. Nemhauser","year":"1998","unstructured":"Nemhauser, G. L., Trick, M. A.: Scheduling a major college basketball conference. Operations Research 46, 1\u20138, 1998.","journal-title":"Operations Research"},{"key":"5_CR54","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","volume":"6","author":"M. W. Padberg","year":"1987","unstructured":"Padberg, M. W., Rinaldi, G.: Optimization ofa 532 City Symmetric Traveling Salesman Problem by Branch and Cut. Operations Research Letters 6, 1\u20137, 1987.","journal-title":"Operations Research Letters"},{"key":"5_CR55","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M. W. Padberg","year":"1991","unstructured":"Padberg, M. W., Rinaldi, G.: A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Review 33, 60\u2013100, 1991.","journal-title":"SIAM Review"},{"key":"5_CR56","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01580850","volume":"47","author":"M.W. Padberg","year":"1990","unstructured":"Padberg, M.W., Rinaldi, G.: An efficient algorithm for the minimum capacity cut problem. Mathematical Programming47, 19\u201336, 1990.","journal-title":"Mathematical Programming"},{"key":"5_CR57","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01580861","volume":"47","author":"M.W. Padberg","year":"1990","unstructured":"Padberg, M.W., Rinaldi, G.: Facet Identification for the Symmetric Traveling Salesman Polytope. Mathematical Programming 47, 219\u2013257, 1990.","journal-title":"Mathematical Programming"},{"key":"5_CR58","unstructured":"Poljak, S., Tuza, Z.: The max-cut problem\u2014A survey, Institute ofMathematics, Academia Sinica, 1994."},{"key":"5_CR59","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1287\/ijoc.4.2.206","volume":"4","author":"G. Reinelt","year":"1992","unstructured":"Reinelt, G., Fast heuristics for large geometric traveling salesman problems. ORSA Journal on Computing 4, 206\u2013217, 1992.","journal-title":"ORSA Journal on Computing"},{"key":"5_CR60","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB-A Traveling Salesman Problem Library. ORSA Journal On Computing 3, 376\u2013384, 1991.","journal-title":"ORSA Journal On Computing"},{"key":"5_CR61","unstructured":"R\u00e9gin, J.-C.: Minimization ofthe number ofbreaks in sports scheduling problems using constraint programming. Talk presented at DIMACS Workshop on Constraint Programming and Large Scale Discrete Optimization, Sep. 14\u201319, 1998."},{"key":"5_CR62","unstructured":"R\u00e9gin, J.-C.: Modelling with constraint programming. Talk presented at Dagstuhl Seminar on Constraint Programming and Integer Programming, Jan. 17\u201321, 2000."},{"key":"5_CR63","unstructured":"Thienel, S.: ABACUS \u2014 A Branch And CUt System. Doctoral Thesis, Universit \u00e4t zu K\u00f6ln, 1995."},{"key":"5_CR64","unstructured":"Thienel, S.: A Simple TSP-Solver: An ABACUS Tutorial. Technical Report 96.245, Universit\u00e4t zu K\u00f6ln, 1996."},{"key":"5_CR65","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0166-218X(92)90252-6","volume":"35","author":"J. A. M. Schreuder","year":"1992","unstructured":"Schreuder, J. A. M.: Combinatorial aspects ofconstruction of competition Dutch Professional Football Leagues. Discrete Applied Mathematics 35, 301\u2013312, 1992.","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR66","doi-asserted-by":"crossref","unstructured":"Trick, M. A.: A schedule-then-break approach to sports timetabling. Proceedings of PATAT 2000, to appear.","DOI":"10.1007\/3-540-44629-X_15"},{"key":"5_CR67","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01300970","volume":"3","author":"P.H. Vance","year":"1994","unstructured":"Vance, P.H., Barnhart, C., Johnson, E.L., Nemhauser, G.L.: Solving Binary Cutting Stock Problems by Column Generation and Branch-and-Bound. Computational Optimization and Applications 3, 111\u2013130, 1994.","journal-title":"Computational Optimization and Applications"}],"container-title":["Lecture Notes in Computer Science","Computational Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45586-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:38:58Z","timestamp":1558258738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45586-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428770","9783540455868"],"references-count":67,"URL":"https:\/\/doi.org\/10.1007\/3-540-45586-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"19 November 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}