{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T10:31:55Z","timestamp":1720693915195},"reference-count":18,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0167-6377(98)00013-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:03:44Z","timestamp":1027641824000},"page":"83-95","source":"Crossref","is-referenced-by-count":26,"title":["Introduction to ABACUS \u2013 a branch-and-cut system"],"prefix":"10.1016","volume":"22","author":[{"given":"Michael","family":"J\u00fcnger","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Thienel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(98)00013-3_BIB1","doi-asserted-by":"crossref","unstructured":"C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, P.H. Vance, Branch-and-price: column generation for huge integer programs, Oper. Res. (1998), to appear.","DOI":"10.1287\/opre.46.3.316"},{"key":"10.1016\/S0167-6377(98)00013-3_BIB2","unstructured":"T. Christof, Low-dimensional0\/1-polytopes and branch-and-cut in combinatorial optimization, Ph.D. Thesis, Universit\u00e4t Heidelberg, 1997."},{"key":"10.1016\/S0167-6377(98)00013-3_BIB3","doi-asserted-by":"crossref","unstructured":"T. Christof, M. J\u00fcnger, J. Kececioglu, P. Mutzel, G. Reinelt, A branch-and-cut approach to physical mapping with end-probes, in First Annual International Conference Molecular Biology, ACM, New York, 1997.","DOI":"10.1145\/267521.267532"},{"key":"10.1016\/S0167-6377(98)00013-3_BIB4","unstructured":"CPLEX Optimization, Inc. (1995) Using the CPLEXTM Callable Library."},{"key":"10.1016\/S0167-6377(98)00013-3_BIB5","unstructured":"J. Esparza, S. Melzer, Verification of safety properties using integer programming: beyond the state equation, Technical Report, Technische Universit\u00e4t M\u00fcnchen, 1997."},{"key":"10.1016\/S0167-6377(98)00013-3_BIB6","doi-asserted-by":"crossref","unstructured":"M. Funke, G. Reinelt, A polyhedral approach to the feedback vertex set, in: W.H. Cunningham, S.T. McCormick, M. Queyranne (Eds.), Integer Programming and Combinatorial Optimization (5th International IPCO Conference, Vancouver, Canada, June 1996, Proceedings), vol. 1084 of Lecture Notes in Computer Science, Springer, Berlin, 1996, pp. 445\u2013459.","DOI":"10.1007\/3-540-61310-2_33"},{"key":"10.1016\/S0167-6377(98)00013-3_BIB7","doi-asserted-by":"crossref","unstructured":"P. Gritzmann, D. Prangenberg, S. de Vries, M. Wiegelmann, Sucess and failure of certain reconstruction and uniqueness algorithms in discrete tomography, Technical Report, Technische Universit\u00e4t M\u00fcnchen, 1997.","DOI":"10.1002\/(SICI)1098-1098(1998)9:2\/3<101::AID-IMA6>3.3.CO;2-I"},{"key":"10.1016\/S0167-6377(98)00013-3_BIB8","unstructured":"IBM Corporation, Optimization Subroutine Library \u2013 Guide and Reference, Release 2.1, 1995."},{"key":"10.1016\/S0167-6377(98)00013-3_BIB9","doi-asserted-by":"crossref","unstructured":"M. J\u00fcnger, E.K. Lee, P. Mutzel, T. Odenthal, A polyhedal approach to the multi-layer crossing minimization problem, in: F. Di. Battista (ed.) Proc. Graph Drawing 1997, Lecture Notes in Computer Science 1353, Springer, Heidelberg, 1997, pp. 13\u201324.","DOI":"10.1007\/3-540-63938-1_46"},{"key":"10.1016\/S0167-6377(98)00013-3_BIB10","doi-asserted-by":"crossref","unstructured":"M. J\u00fcnger, G. Reinelt, S. Thienel, Practical problem solving with cutting plane algorithms in combinatorial optimization, in: W. Cook, L. Lov\u00e1sz, P. Seymour (Eds.), Combinatorial Optimization, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence, RI, 1995, pp. 111\u2013152.","DOI":"10.1090\/dimacs\/020\/02"},{"key":"10.1016\/S0167-6377(98)00013-3_BIB11","unstructured":"M. J\u00fcnger, S. Thienel, The design of the branch-and-cut system ABACUS, Technical Report, Universit\u00e4t zu K\u00f6ln, 1997."},{"key":"10.1016\/S0167-6377(98)00013-3_BIB12","unstructured":"V. Kaibel, Polyhedral combinatorics of QAPs with less objects than locations (extended abstract), Technical Report 97.297, Universit\u00e4t zu K\u00f6ln, 1997."},{"key":"10.1016\/S0167-6377(98)00013-3_BIB13","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","article-title":"MINTO, a mixed integer optimizer","volume":"15","author":"Nemhauser","year":"1994","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(98)00013-3_BIB14","doi-asserted-by":"crossref","unstructured":"K. Reinert, H.P. Lenhof, P. Mutzel, K. Mehlhorn, J.D. Kececioglou, A branch-and-cut algorithm for multiple sequence alignment, First Annual International Conference on Computational Molecular Biology, ACM, New York, 1997.","DOI":"10.1145\/267521.267845"},{"key":"10.1016\/S0167-6377(98)00013-3_BIB15","unstructured":"S. Thienel, ABACUS \u2013 A Branch-And-CUt Sytem, Ph.D. Thesis, Universit\u00e4t zu K\u00f6ln, 1995."},{"key":"10.1016\/S0167-6377(98)00013-3_BIB16","unstructured":"S. Thienel, A simple TSP-solver, Technical Report, Universit\u00e4t zu K\u00f6ln, 1996. http:\/\/www.informatik.uni-koeln.de\/1s_juenger\/ projects\/abacus\/abacus_tutorial.ps.gz."},{"key":"10.1016\/S0167-6377(98)00013-3_BIB17","unstructured":"S. Thienel, ABACUS 2.0: User\u2019s Guide and Reference Manual, Universit\u00e4t zu K\u00f6ln, 1996. http:\/\/www.informatik.uni-koeln.de\/ 1s_juenger\/projects\/abacus\/manual.ps.gz."},{"key":"10.1016\/S0167-6377(98)00013-3_BIB18","unstructured":"R. Wunderling, SoPlex, The Sequential object-oriented simplex class library, 1997. http:\/\/www.zib.de\/Optimization\/Software\/ Sopolex\/."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000133?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000133?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T21:14:18Z","timestamp":1704143658000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637798000133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":18,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0167637798000133"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(98)00013-3","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}