{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T06:44:00Z","timestamp":1773384240651,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540727910","type":"print"},{"value":"9783540727927","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72792-7_22","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T12:07:11Z","timestamp":1182773231000},"page":"280-294","source":"Crossref","is-referenced-by-count":47,"title":["Generating Multiple Solutions for Mixed Integer Programming Problems"],"prefix":"10.1007","author":[{"given":"Emilie","family":"Danna","sequence":"first","affiliation":[]},{"given":"Mary","family":"Fenelon","sequence":"additional","affiliation":[]},{"given":"Zonghao","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Roland","family":"Wunderling","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Sang, T., Bacchus, F., Beame, P., Kautz, H., Pitassi, T.: Combining Component Caching and Clause Learning for Effective Model Counting. In: SAT (2004)"},{"key":"22_CR2","unstructured":"Balas, E., Saxena, A.: Optimizing over the split closure. Technical Report 2006-E5, Tepper School of Business, CMU (2005)"},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-0-387-35514-6_2","volume-title":"System Modelling and Optimization: Methods, Theory, and Applications","author":"R.E. Bixby","year":"2000","unstructured":"Bixby, R.E., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: MIP: Theory and practice \u2014 closing the gap. In: Powell, M.J.D., Scholtes, S. (eds.) System Modelling and Optimization: Methods, Theory, and Applications, pp. 19\u201349. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"22_CR4","first-page":"12","volume":"58","author":"R.E. Bixby","year":"1998","unstructured":"Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: An updated mixed integer programming library: MIPLIB 3.0. Journal Optima\u00a058, 12\u201315 (1998)","journal-title":"Journal Optima"},{"key":"22_CR5","unstructured":"Cook, W., Fukasawa, R., Goycoolea, M.: Choosing the best cuts. In: Workshop on mixed integer programming, MIP (2006)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"CPLEX 10.0 Manual, Ilog Inc. (2006)","DOI":"10.1016\/S1365-6937(06)71039-5"},{"issue":"1","key":"22_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E. Danna","year":"2005","unstructured":"Danna, E., Rothberg, E., Le Pape, C.: Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming\u00a0102(1), 71\u201390 (2005)","journal-title":"Mathematical Programming"},{"key":"22_CR8","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Lodi, A.: Separating from the MIR closure of polyhedra. In: Workshop on mixed integer programming, MIP (2006)"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/11496915_2","volume-title":"Integer Programming and Combinatorial Optimization","author":"M. Fischetti","year":"2005","unstructured":"Fischetti, M., Lodi, A.: Optimizing over the first Chv\u00e0tal closure. In: J\u00fcnger, M., Kaibel, V. (eds.) IPCO 2005. LNCS, vol.\u00a03509, pp. 12\u201322. Springer, Heidelberg (2005)"},{"key":"22_CR10","unstructured":"Fischetti, M., Lodi, A.: MIP models for MIP separation. In: Workshop on mixed integer programming, MIP (2006)"},{"key":"22_CR11","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/978-1-4615-4567-5_17","volume-title":"OR computing tools for modeling, optimization and simulation: interfaces in computer science and operations research","author":"F. Glover","year":"2000","unstructured":"Glover, F., L\u00f8kketangen, A., Woodruff, D.L.: Scatter search to generate diverse MIP solutions. In: Laguna, M., Gonz\u00e1lez-Velarde, J.L. (eds.) OR computing tools for modeling, optimization and simulation: interfaces in computer science and operations research, pp. 299\u2013317. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Greistorfer, P., L\u00f8kketangen, A., Vo\u00df, S., Woodruff, D.L.: Experiments concerning sequential versus simultaneous maximization of objective function and distance. Submitted to Journal of Heuristics (2006)","DOI":"10.1007\/s10732-007-9053-z"},{"key":"22_CR13","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/ijoc.3.2.121","volume":"3","author":"K. Hoffman","year":"1991","unstructured":"Hoffman, K., Padberg, M.: Improving Representations of Zero-one Linear Programs for Branch-and-Cut. ORSA Journal of Computing\u00a03, 121\u2013134 (1991)","journal-title":"ORSA Journal of Computing"},{"key":"22_CR14","unstructured":"Karamanov, M., Cornuejols, G.: Cutting Planes Selection. In: Workshop on mixed integer programming, MIP (2006)"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1016\/S0098-1354(00)00323-9","volume":"24","author":"S. Lee","year":"2000","unstructured":"Lee, S., Phalakornkule, C., Domach, M.M., Grossmann, I.E.: Recursive MILP model for finding all the alternate optima in LP models for metabolic networks. Computers and Chemical Engineering\u00a024, 711\u2013716 (2000)","journal-title":"Computers and Chemical Engineering"},{"key":"22_CR16","unstructured":"MIPLIB (2003), http:\/\/miplib.zib.de\/"},{"key":"22_CR17","unstructured":"Rothberg, E.: It\u2019s a beautiful day in the neighborhood \u2014 Local search in mixed integer programming. In: Workshop on mixed integer programming, MIP (2005)"},{"key":"22_CR18","unstructured":"Rothberg, E.: An evolutionary algorithm for polishing mixed integer programming solutions. To appear in INFORMS Journal on Computing"},{"key":"22_CR19","unstructured":"Schittekat, P., Sorensen, K.: Coping with unquantifiable criteria by generating structurally different solutions \u2014 Applications to a large real-life location-routing problem in the automative industry. In: ISMP (2006)"},{"key":"22_CR20","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science\u00a08, 189\u2013201 (1979)","journal-title":"Theoretical Computer Science"},{"key":"22_CR21","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"9","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM Journal of Computing\u00a09, 410\u2013421 (1979)","journal-title":"SIAM Journal of Computing"},{"key":"22_CR22","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley, New York (1998)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72792-7_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:05:21Z","timestamp":1605762321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72792-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540727910","9783540727927"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72792-7_22","relation":{},"subject":[]}}