{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:33:23Z","timestamp":1725536003310},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033667"},{"type":"electronic","value":"9783642033674"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03367-4_45","type":"book-chapter","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T07:56:42Z","timestamp":1248076602000},"page":"519-529","source":"Crossref","is-referenced-by-count":6,"title":["Integer Programming: Optimization and Evaluation Are Equivalent"],"prefix":"10.1007","author":[{"given":"James B.","family":"Orlin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abraham P.","family":"Punnen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas S.","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"45_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Heidelberg (1999)"},{"key":"45_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(98)00031-5","volume":"23","author":"N. Chakravarti","year":"1998","unstructured":"Chakravarti, N., Wagelmans, A.P.M.: Calculation of stability radii for combinatorial optimization problems. Operations Research Letters\u00a023, 1\u20137 (1998)","journal-title":"Operations Research Letters"},{"key":"45_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0020-0190(90)90188-4","volume":"33","author":"P. Crescenzi","year":"1990","unstructured":"Crescenzi, P., Silvestri, R.: Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems. Information Processing Letters\u00a033, 221\u2013226 (1990)","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure Nash equilibria. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, pp. 604\u2013612 (2004)","key":"45_CR5","DOI":"10.1145\/1007352.1007445"},{"key":"45_CR6","first-page":"1541","volume-title":"Handbook of Combinatorics, ch. 28","author":"M. Gr\u00f6tschel","year":"1995","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L.: Combinatorial optimization. In: Graham, R.L., Gr\u00f6tschel, M., Lov\u00e1sz, L. (eds.) Handbook of Combinatorics, ch. 28, vol.\u00a02, pp. 1541\u20131597. Elsevier, Amsterdam (1995)"},{"key":"45_CR7","first-page":"223","volume-title":"The Traveling Salesman Problem and Its Variations","author":"G. Gutin","year":"2002","unstructured":"Gutin, G., Yeo, A., Zverovitch, A.: Exponential neighborhoods and domination analysis for the TSP. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and Its Variations, ch.\u00a06, pp. 223\u2013256. Kluwer, Dordrecht (2002)"},{"doi-asserted-by":"crossref","unstructured":"Johnson, D.S.: The NP-completeness column: Finding needles in haystacks. ACM Transactions on Algorithms 3 (2007)","key":"45_CR8","DOI":"10.1145\/1240233.1240247"},{"key":"45_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? Journal of Computer and System Sciences\u00a037, 79\u2013100 (1988)","journal-title":"Journal of Computer and System Sciences"},{"doi-asserted-by":"crossref","unstructured":"Krentel, M.W., Structure in locally optimal solutions, in Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, NC, 1989, 216\u2013221.","key":"45_CR10","DOI":"10.1109\/SFCS.1989.63481"},{"key":"45_CR11","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1137\/S0097539703431007","volume":"33","author":"J.B. Orlin","year":"2004","unstructured":"Orlin, J.B., Punnen, A.P., Schulz, A.S.: Approximate local search in combinatorial optimization. SIAM Journal on Computing\u00a033, 1201\u20131214 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"45_CR12","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs (1982)"},{"unstructured":"Ramaswamy, R., Chakravarti, N.: Complexity of determining exact tolerances for min-sum and min-max combinatorial optimization problems, Working Paper WPS-247\/95, Indian Institute of Management, Calcutta, India (1995)","key":"45_CR13"},{"key":"45_CR14","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0220004","volume":"20","author":"A.A. Sch\u00e4ffer","year":"1991","unstructured":"Sch\u00e4ffer, A.A., Yannakakis, M.: Simple local search problems that are hard to solve. SIAM Journal on Computing\u00a020, 56\u201387 (1991)","journal-title":"SIAM Journal on Computing"},{"key":"45_CR15","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)"},{"key":"45_CR16","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-540-76796-1_19","volume-title":"Research Trends in Combinatorial Optimization","author":"A.S. Schulz","year":"2009","unstructured":"Schulz, A.S.: On the relative complexity of 15 problems related to 0\/1-integer programming. In: Cook, W.J., Lov\u00e1sz, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, ch.\u00a019, pp. 399\u2013428. Springer, Berlin (2009)"},{"key":"45_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/3-540-60313-1_164","volume-title":"Algorithms - ESA \u201995","author":"A.S. Schulz","year":"1995","unstructured":"Schulz, A.S., Weismantel, R., Ziegler, G.M.: 0\/1-integer programming: Optimization and augmentation are equivalent. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol.\u00a0979, pp. 473\u2013483. Springer, Heidelberg (1995)"},{"key":"45_CR18","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0166-218X(98)00151-6","volume":"91","author":"S. Hoesel van","year":"1999","unstructured":"van Hoesel, S., Wagelmans, A.P.M.: On the complexity of postoptimality analysis of 0\/1 programs. Discrete Applied Mathematics\u00a091, 251\u2013263 (1999)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03367-4_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T06:34:51Z","timestamp":1552113291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03367-4_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033667","9783642033674"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03367-4_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}