{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T18:05:52Z","timestamp":1783706752638,"version":"3.55.0"},"reference-count":83,"publisher":"Wiley","issue":"11","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5722,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw: Pract. Exper."],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1002\/1097-024x(200009)30:11<1325::aid-spe342>3.0.co;2-t","type":"journal-article","created":{"date-parts":[[2002,9,11]],"date-time":"2002-09-11T01:20:53Z","timestamp":1031707253000},"page":"1325-1352","source":"Crossref","is-referenced-by-count":49,"title":["The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization"],"prefix":"10.1002","volume":"30","author":[{"given":"Michael","family":"J\ufffdnger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Thienel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2000]]},"reference":[{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB1","doi-asserted-by":"crossref","DOI":"10.1515\/9781400884179","volume-title":"Linear Programming and Extensions","author":"Dantzig","year":"1963","unstructured":"Linear Programming and Extensions. Princeton University Press: Princeton, 1963."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB2","first-page":"5","volume-title":"History of Mathematical Programming","author":"Balinski","year":"1991","unstructured":"Mathematical programming: Journal, society, recollections. History of Mathematical Programming, (eds.). CWI North-Holland, 1991; 5-18."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB3","volume":"20","author":"Charnes","year":"1952","journal-title":"Econometrica"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"Gomory","year":"1958","journal-title":"Bulletin of the American Mathematical Society"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB5","first-page":"1","volume":"19","author":"Balas","year":"1996","journal-title":"OR Letters"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB6","doi-asserted-by":"crossref","first-page":"493","DOI":"10.2307\/1910129","volume":"28","author":"Land","year":"1960","journal-title":"Econometrica"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB7","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proceedings of the American Mathematical Society"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerische Mathematik"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB9","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canadian Journal of Mathematics"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB10","first-page":"393","volume":"2","author":"Dantzig","year":"1954","journal-title":"Operations Research"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB11","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"Gr\u00f6tschel","year":"1984","journal-title":"Operations Research"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB12","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1137\/0211053","volume":"11","author":"Karp","year":"1982","journal-title":"SIAM Journal on Computing"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB13","author":"Christof","year":"1997","unstructured":"Low-dimensional 0\/1-polytopes and branch-and-cut in combinatorial optimization. PhD Thesis, Universit\u00e4t Heidelberg, 1997."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB14","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"Padberg","year":"1991","journal-title":"SIAM Review"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB15","series-title":"Handbook on O","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0927-0507(05)80121-5","volume-title":"Network Models","author":"J\u00fcnger","year":"1995","unstructured":"The traveling salesman problem. Network Models (Handbook on Operations Research and Management Sciences, vol. 7), (eds.). North-Holland: Amsterdam, 1995; 225-330."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB16","series-title":"DIMACS Series","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1090\/dimacs\/020\/02","volume-title":"Combinatorial Optimization","author":"J\u00fcnger","year":"1995","unstructured":"Practical problem solving with cutting plane algorithms in combinatorial optimization. Combinatorial Optimization (DIMACS Series in Discrete Mathematics and Theoretical Computer Science), (eds.). American Mathematical Society, 1995; 111-152."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB17","first-page":"45","volume-title":"Annotated Bibliographies in Combinatorial Optimization","author":"Caprara","year":"1997","unstructured":"Branch-and-cut algorithms. Annotated Bibliographies in Combinatorial Optimization, (eds.). Wiley, 1997; 45-64."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB18","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"Gilmore","year":"1961","journal-title":"Operations Research"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB19","author":"IBM Corporation","year":"1979","unstructured":"IBM Corporation. IBM Mathematical Programming System Extended\/370 (MPSX\/370), Mixed Integer Programming\/370 (MIP\/370), 1979."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB20","author":"Murtagh","year":"1995","unstructured":"Minos 5.4 user's guide. Technical Report, Stanford University, Department of Operations Research, 1995."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB21","author":"LINDO SYSTEMS Inc.","year":"1997","unstructured":"LINDO SYSTEMS Inc., LINDO user's manual, 1997."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB22","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/355972.355976","volume":"7","author":"Marsten","year":"1981","journal-title":"ACM Transations of Mathematical Software"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB23","author":"IBM Corporation","year":"1995","unstructured":"IBM Corporation, Optimization Subroutine Library - Guide and Reference, Release 2.1, 1995."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB24","volume-title":"Using the Cplex Callable Library","author":"Cplex","year":"1997","unstructured":"Cplex. Using the Cplex Callable Library. Cplex Optimization, Inc, 1997."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB25","year":"1995","unstructured":"Dash Associates. XPRESS-MP, Optimisation Subroutine Library, 1995."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB26","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/0377-2217(94)90312-3","volume":"72","author":"Suhl","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB27","author":"Nemhauser","year":"1996","unstructured":"Functional description of MINTO, a Mixed INTeger Optimizer, version 2.3. Technical Report, Georgia Institute of Technology, School of Industrial and Systems Engineering, 1996."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB28","volume-title":"Software Engineering","author":"Sommerville","year":"1992","unstructured":"Software Engineering. Addison-Wesley: Reading, MA, 1992."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB29","volume-title":"Object-Oriented Analysis and Design with Applications","author":"Booch","year":"1994","unstructured":"Object-Oriented Analysis and Design with Applications. The Benjamin Cummings Publishing Company: Redwood City, CA, 1994."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB30","volume-title":"The C++ Programming Language","author":"Stroustrup","year":"1993","unstructured":"The C++ Programming Language (2nd edn). Addison-Wesley: Reading, MA, 1993."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB31","author":"Thienel","year":"1995","unstructured":"ABACUS?A Branch-And-CUt system. PhD Thesis, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, 1995."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB32","author":"J\u00fcnger","year":"1997","unstructured":"The design of the branch-and-cut system ABACUS. Technical Report, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, 1997."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB33","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0167-6377(98)00013-3","volume":"22","author":"J\u00fcnger","year":"1998","journal-title":"Operations Research Letters"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB34","author":"Thienel","year":"1996","unstructured":"A simple TSP-solver. Technical Report, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, http:\/\/www.informatik.uni-koeln.de\/ls_juenger\/projects\/abacus\/abacus_tutorial.ps.gz, 1996."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB35","author":"Thienel","year":"1997","unstructured":"ABACUS 2.0: User's Guide and Reference Manual. Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, 1997. http:\/\/www.informatik.uni-koeln.de\/ls_juenger\/projects\/abacus\/manual.ps.gz."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB36","volume-title":"Reusable Software, The Base Object-Oriented Component Libraries","author":"Meyer","year":"1994","unstructured":"Reusable Software, The Base Object-Oriented Component Libraries. Prentice-Hall: Hertfordshire, 1994."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB37","first-page":"22","volume":"1","author":"Johnson","year":"1988","journal-title":"Journal of Object-Oriented Programming"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB38","author":"Thienel","year":"1996","unstructured":"ABACUS 1.2: User's guide and reference manual. Technical Report, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, 1996."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB39","author":"Thienel","year":"1996","unstructured":"A simple TSP-solver. Technical Report, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, http:\/\/www.informatik.uni-koeln.de\/ls_juenger\/projects\/abacus\/abacus_tutorial.ps.gz, 1996."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB40","year":"1995","unstructured":"INFORMATION PROCESSING SYSTEM Accredited Standards Committee, X3. The ISO\/ANSI C++ Draft, 1995. http:\/\/www.cygnus.com\/misc\/wp\/."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB41","author":"Mehlhorn","year":"1996","unstructured":"The LEDA User Manual Version R 3.4.1. Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, 1996."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB42","volume-title":"Data Abstraction and Object-Oriented Programming in C++","author":"Gorlen","year":"1990","unstructured":"Data Abstraction and Object-Oriented Programming in C++. John Wiley, 1990."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB43","author":"Lee","year":"1995","unstructured":"The standard template library. Technical Report, Rensselaer Polytechnic Institute, 1995. http:\/\/www.cs.rpi.edu\/?musser\/stl.html."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB44","author":"J\u00fcnger","year":"1996","unstructured":"On the SQAP polytope. Technical Report, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, 1996. To appear in SIAM Journal of Optimization."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB45","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01300970","volume":"3","author":"Vance","year":"1994","journal-title":"Computational Optimization and Applications"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB46","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"Balas","year":"1993","journal-title":"Mathematical Programming"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB47","series-title":"Handbook of C","first-page":"1649","volume-title":"Polyhedral combinatorics","author":"Schrijver","year":"1995","unstructured":"Polyhedral combinatorics (Handbook of Combinatorics, vol. 2), (eds.). Elsevier, 1995; 1649-1704."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB48","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01580109","volume":"5","author":"Chv\u00e1tal","year":"1973","journal-title":"Mathematical Programming"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB49","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/moor.7.1.67","volume":"7","author":"Padberg","year":"1982","journal-title":"Mathematics of Operations Research"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB50","first-page":"183","volume":"40","author":"J\u00fcnger","year":"1994","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB51","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA Journal on Computing"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB52","author":"Naddef","year":"1999","unstructured":"Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation. Technical Report, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, 1999, to appear."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB53","author":"Naddef","year":"1999","unstructured":"Efficient separation routines for the symmetric traveling salesman problem II: separating multi handle inequalities. Technical Report, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, 1999, to appear."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB54","author":"Balas","year":"1993","unstructured":"Solving mixed 0-1 programs by a lift-and-project method. Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1993; 232-242."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB55","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1287\/mnsc.39.6.657","volume":"39","author":"Hoffman","year":"1993","journal-title":"Management Science"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB56","author":"Wunderling","year":"1997","unstructured":"SoPlex, The Sequential object-oriented simplex class library, 1997. http:\/\/www.zib.de\/Optimization\/Software\/Soplex\/."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB57","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"Savelsbergh","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB58","first-page":"291","volume-title":"Proceedings on the Third IPCO Conference","author":"Clochard","year":"1993","unstructured":"Using path inequalities in a branch-and-cut code for the symmetric traveling salesman problem. Proceedings on the Third IPCO Conference, (eds.). 1993; 291-311."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB59","first-page":"269","volume-title":"Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling","author":"Ryan","year":"1981","unstructured":"An integer programming approach to scheduling. Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, (ed.). North-Holland: Amsterdam, 1981; 269-280."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB60","author":"Berkelaar","year":"1995","unstructured":"lp_solve 2.0, 1995. ftp:\/\/ftp.es.ele.tue.nl\/pub\/lp_solve."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB61","author":"Saltzman","year":"1994","unstructured":"Broad selection of software packages available OR\/MS Today 1994; 42-51."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB62","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","volume":"15","author":"Nemhauser","year":"1994","journal-title":"Operations Research Letters"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB63","author":"Engel","year":"1997","unstructured":"Branching algorithms for crew scheduling problems. Master's Thesis, Chalmers University, 1997."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB64","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-3-642-58409-1_11","volume-title":"Operations Research Proceedings 1998","author":"Mutzel","year":"1999","unstructured":"The constrained crossing minimization problem?a first approach. Operations Research Proceedings 1998. Springer, 1999; 125-134."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB65","author":"Gritzmann","year":"1997","unstructured":"Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography. Technical Report, Technische Universit\u00e4t M\u00fcnchen, 1997."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB66","series-title":"Lecture Notes","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/3-540-61310-2_33","volume-title":"Integer Programming and Combinatorial Optimization (Proceedings of the 5th International IPCO Conference, Vancouver, Canada, June 1996)","author":"Funke","year":"1996","unstructured":"A polyhedral approach to the feedback vertex set. Integer Programming and Combinatorial Optimization (Proceedings of the 5th International IPCO Conference, Vancouver, Canada, June 1996) (Lecture Notes in Computer Science, vol. 1084), (eds.). Springer Verlag, 1996; 445-459."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB67","author":"Kupke","year":"1998","unstructured":"Ein Branch-and-Price Algorithmus f\u00fcr das ganzzahlige Verschnittproblem. Master's Thesis, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, 1998."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB68","first-page":"1","volume":"4","author":"Christof","year":"1996","journal-title":"TOP (Spanish Statistical and Operations Research Society)"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB69","first-page":"74","volume-title":"Operations Research Proceedings","author":"J\u00fcnger","year":"1997","unstructured":"Relaxations of the max cut problem and computation of spin glass ground states. Operations Research Proceedings, et al. (eds.). Springer: Heidelberg, 1997; 74-83."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB70","series-title":"Lecture Notes","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/3-540-63938-1_46","volume-title":"Proceedings of Graph Drawing '97","author":"J\u00fcnger","year":"1997","unstructured":"A polyhedral approach to the multi-layer crossing minimization problem. Proceedings of Graph Drawing '97 (Lecture Notes in Computer Science, vol. 1353), (ed.). Springer: Heidelberg, 1997; 13-24."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB71","volume-title":"First Annual International Conference on Computational Molecular Biology","author":"Reinert","year":"1997","unstructured":"A branch-and-cut algorithm for multiple sequence alignment. First Annual International Conference on Computational Molecular Biology. ACM, 1997."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB72","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1089\/cmb.1997.4.433","volume":"4","author":"Christof","year":"1997","journal-title":"Journal Computational Biology"},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB73","author":"Pesch","year":"1998","unstructured":"Das pickup-and-delivery problem?betrachtet als modifiziertes traveling-salesman-problem. Master's Thesis, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, 1998."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB74","author":"Fialko","year":"1997","unstructured":"Das Planare Augmentierungsproblem. Master's Thesis, Universit\u00e4t des Saarlandes, Saar-br\u00fccken, 1997."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB75","author":"Fortz","year":"1998","unstructured":"Design of survivable networks with bounded rings. PhD Thesis, Service de Math\u00e9matiques de la Gestion, Universit\u00e9 Libre de Bruxelles, 1998."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB76","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/3-540-69346-7_31","volume-title":"Proceedings of the Sixth Conference on Integer Programming and Combinatorial Optimization","author":"Kaibel","year":"1998","unstructured":"Polyhedral combinatorics of QAPs with less objects than locations. Proceedings of the Sixth Conference on Integer Programming and Combinatorial Optimization. Springer, 1998; 409-422."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB77","author":"Lenhof","year":"1998","unstructured":"A polyhedral approach to RNA sequence structure alignment. Proceedings of the Second Annual International Conference on Computational Molecular Biology RECOMB, 1998."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB78","author":"Verweij","year":"1997","unstructured":"On an integer multicommodity flow problem from the airplane industry. Technical Report UU-CS-1997-38, Department of Computer Science, Utrecht University, Utrecht, 1997."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB79","series-title":"Lecture Notes","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-62495-3_57","volume-title":"Proceedings of the Graph Drawing '96","author":"Mutzel","year":"1997","unstructured":"An alternative method for crossing minimization on hierarchical graphs. Proceedings of the Graph Drawing '96 (Lecture Notes in Computer Science, vol. 1190), (ed.). Springer Verlag, 1997; 318-333."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB80","series-title":"Lecture Notes","first-page":"69","volume-title":"Proceedings of the ISAAC '98","author":"Mutzel","year":"1998","unstructured":"Two layer planarization in graph drawing. Proceedings of the ISAAC '98 (Lecture Notes in Computer Science, vol. 1533), (eds.). Springer Verlag, 1998; 69-78."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB81","author":"Klau","year":"1999","unstructured":"Optimal compaction of orthogonal grid drawings Proceedings of the Seventh Conference on Integer Programming and Combinatorial Optimization IPCO'99, 1999."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB82","author":"Esparza","year":"1997","unstructured":"Verification of safety properties using integer programming: Beyond the state equation. Technical Report, Technische Universit\u00e4t M\u00fcnchen, 1997."},{"key":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T-BIB83","author":"Christof","year":"1998","unstructured":"Consecutive ones and a betweenness problem in computational biology. Proceedings of the 6th Conference on Integer Programming and Combinatorial Optimization (IPCO98), 1998."}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F1097-024X(200009)30:11%3C1325::AID-SPE342%3E3.0.CO;2-T","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/1097-024X(200009)30:11%3C1325::AID-SPE342%3E3.0.CO;2-T","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T01:38:23Z","timestamp":1625103503000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":83,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2000,9]]}},"URL":"https:\/\/doi.org\/10.1002\/1097-024x(200009)30:11<1325::aid-spe342>3.0.co;2-t","relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}