{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:01:32Z","timestamp":1761894092650},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1007\/bf01299207","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T04:33:38Z","timestamp":1111725218000},"page":"317-331","source":"Crossref","is-referenced-by-count":16,"title":["Supernode processing of mixed-integer models"],"prefix":"10.1007","volume":"3","author":[{"given":"Uwe H.","family":"Suhl","sequence":"first","affiliation":[]},{"given":"Ralf","family":"Szymanski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BF01580428","volume":"8","author":"A.L. Brearley","year":"1975","unstructured":"Brearley, A.L., Mitra, G. and Williams, H.P., ?Analysis of mathematical programming problems prior to applying the simplex algorithm,?Math. Prog., 8, 54?83, 1975.","journal-title":"Math. Prog."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"Crowder, H., Johnson, E.L., and Padberg, M.W., ?Solving large-scale zero-one linear programming problems,?Oper. Res., 31, 803?834, 1983.","journal-title":"Oper. Res."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0167-6377(90)90034-3","volume":"9","author":"B.L. Dietrich","year":"1990","unstructured":"Dietrich, B.L. and Escudero, L.F., ?Coefficient reduction for knapsack constraints in 0?1 programs with VUBs,?Oper. Res. Lett., 9, 9?14, 1990.","journal-title":"Oper. Res. Lett."},{"key":"CR4","volume-title":"Coefficient reduction with cover inequalities","author":"B.L. Dietrich","year":"1989","unstructured":"Dietrich, B.L. and Escudero, L.F., ?Coefficient reduction with cover inequalities,? RC 14913, IBM, T. J. Watson Research Center, Yorktown Heights, N.Y., 1989."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0166-218X(93)90044-O","volume":"42","author":"B.L. Dietrich","year":"1993","unstructured":"Dietrich, B.L., Escudero, L.F., and Chance, F., ?Efficient reformulation for 0?1 programms?methods and computational results,?Discrete Applied Mathematics, 42, 147?175, 1993.","journal-title":"Discrete Applied Mathematics"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.29.1.49","volume":"29","author":"M. Guignard","year":"1981","unstructured":"Guignard, M. and Spielberg, K., ?Logical reduction methods in zero-one programming (minimal preferred variables),?Oper. Res., 29, 49?74, 1981.","journal-title":"Oper. Res."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/ijoc.3.2.121","volume":"3","author":"K. Hoffmann","year":"1991","unstructured":"Hoffmann, K. and Padberg, M.W., ?Improving LP-representations of zero-one linear programs for branch-and-cut,?ORSA Journal on Computing, 3, 121?134, 1991.","journal-title":"ORSA Journal on Computing"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02022040","volume":"4","author":"K. Hoffmann","year":"1985","unstructured":"Hoffmann, K. and Padberg, M.W., ?LP-based combinatorial problem solving,?Annals of Operations Research, 4, 145?194, 1985.","journal-title":"Annals of Operations Research"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.33.4.803","volume":"35","author":"E.L. Johnson","year":"1985","unstructured":"Johnson, E.L., Kostreva, M.M. and Suhl, U.H., ?Solving 0?1 integer programming problems arising from large-scale planning models,?Oper. Res., 35, 803?819, 1985.","journal-title":"Oper. Res."},{"key":"CR10","first-page":"169","volume":"16","author":"E.L. Johnson","year":"1982","unstructured":"Johnson, E.L. and Padberg, M.W., ?Degree?Two Inequalities, Clique Facets and Biperfect Graphs,?Ann. Discrete Mathematics, 16, 169?187, 1982.","journal-title":"Ann. Discrete Mathematics"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"1622","DOI":"10.1287\/mnsc.24.15.1622","volume":"24","author":"T.G. Mairs","year":"1978","unstructured":"Mairs, T.G., Wakefield, G.W., Johnson, E.L., and Spielberg, K., ?On a production allocation and allocation and distribution problem,?Management Science, 24, 1622?1630, 1978.","journal-title":"Management Science"},{"key":"CR12","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L. and Wolsey, L.A., ?Integer and Combinatorial Optimization,? Wiley, New York, 1988."},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"Savelsbergh, M.W.P., ?Preprosessing and Probing Techniques for Mixed Integer Programming Problems,?ORSA Journal on Computing, to appear 1994.","DOI":"10.1287\/ijoc.6.4.445"},{"key":"CR14","series-title":"IBM Research Report RC 8219","volume-title":"An experimental software system for large scale 0?1 problems with efficient data structures and access to MPSX\/370","author":"K. Spielberg","year":"1980","unstructured":"Spielberg, K. and Suhl, U.H., ?An experimental software system for large scale 0?1 problems with efficient data structures and access to MPSX\/370,? IBM Research Report RC 8219, IBM T. J. Watson Research Center, Yorktown Heights, N.Y., 1980."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01586089","volume":"32","author":"U.H. Suhl","year":"1985","unstructured":"Suhl, U.H., ?Solving large-scale mixed integer programs with fixed charge variables?,Math. Programming, 32, 165?182, 1985.","journal-title":"Math. Programming"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1287\/ijoc.2.4.325","volume":"2","author":"U.H. Suhl","year":"1990","unstructured":"Suhl, U.H. and Suhl, L.M., ?Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases,?ORSA Journal on Computing, 2, 325?335, 1990.","journal-title":"ORSA Journal on Computing"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF02025534","volume":"43","author":"L.M. Suhl","year":"1993","unstructured":"Suhl, L.M. and Suhl, U.H., ?A Fast LU-update for linear programming,?Annals of Operations Research, 43, 33?47, 1993.","journal-title":"Annals of Operations Research"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/0377-2217(94)90312-3","volume":"72","author":"U.H. Suhl","year":"1994","unstructured":"Suhl, U.H., ?MOPS?Mathematical Optimization System,?European Journal of Operational Research, 72, 312?322, 1994.","journal-title":"European Journal of Operational Research"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.35.1.45","volume":"35","author":"T. Roy Van","year":"1987","unstructured":"Van Roy, T. and Wolsey, L.A., ?Solving mixed integer programming problems using automatic reformulation,?Oper. Res., 35, 45?57, 1987.","journal-title":"Oper. Res."},{"key":"CR20","volume-title":"Model Building in Mathematical Programming","author":"H.P. Williams","year":"1978","unstructured":"Williams, H.P., ?Model Building in Mathematical Programming,? Wiley, N.Y., 1978."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01589102","volume":"45","author":"L.A. Wolsey","year":"1989","unstructured":"Wolsey, L.A., ?Tight formulations for mixed integer programming: A survey,?Math. Programming, 45, 173?191, 1989.","journal-title":"Math. Programming"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299207.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01299207\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299207","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T08:02:50Z","timestamp":1706083370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01299207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["BF01299207"],"URL":"https:\/\/doi.org\/10.1007\/bf01299207","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}