{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:01Z","timestamp":1725664561363},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540594086"},{"type":"electronic","value":"9783540492450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59408-6_50","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:15:32Z","timestamp":1330276532000},"page":"172-184","source":"Crossref","is-referenced-by-count":0,"title":["Use of hidden network structure in the set partitioning problem"],"prefix":"10.1007","author":[{"given":"Agha Iqbal","family":"Ali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyun-Soo","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffery L.","family":"Kennington","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"14_CR1","volume-title":"Working Paper","author":"A. I. Ali","year":"1994","unstructured":"Ali, A. I., H. Han. 1994a. \u201cComputational Implementation of Fujishige's Graph Realizability Algorithm,\u201d Working Paper, School of Management, University of Massachusetts at Amherst."},{"key":"14_CR2","volume-title":"Working Paper","author":"A. I. Ali","year":"1994","unstructured":"Ali, A. I., H. Han. 1994b. \u201cExtracting Hidden Network Submatrices of a (0,1) Matrix Using a PQ-graph,\u201d Working Paper, School of Management, University of Massachusetts at Amherst."},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0377-2217(89)90471-2","volume":"38","author":"A. I. Ali","year":"1989","unstructured":"Ali, A. I., H. Thiagarajan. 1989. \u201cA Network Relaxtion Based Enumeration Algorithm for Set Partioning,\u201d European Journal of Operational Research, 38, 76\u201389.","journal-title":"European Journal of Operational Research"},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF01588309","volume":"18","author":"A. Avis","year":"1980","unstructured":"Avis, A. 1980. \u201cA Note on Some Computationally Difficult Set Covering problems,\u201d Mathematical Programming, 18, 135\u2013143.","journal-title":"Mathematical Programming"},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BFb0120885","volume":"12","author":"E. Balas","year":"1980","unstructured":"Balas, E. 1980. \u201cCutting Planes from Conditional Bounds: A New Approach to Set Covering,\u201d Mathematical Programming Study, 12, 19\u201336.","journal-title":"Mathematical Programming Study"},{"key":"14_CR6","volume-title":"Combinatorial Optimization","author":"E. Balas","year":"1979","unstructured":"Balas, E., M. W. Padberg. 1979. Set Partioning \u2014 A Survey. In Combinatorial Optimization, Christofides, N., Mingozzi, P., Toth, P. and Sandi, C. (eds.). John Wiley, Chichester, England."},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/0167-6377(82)90038-4","volume":"1","author":"J. Bartholdi","year":"1982","unstructured":"Bartholdi, J. 1982. \u201cA Good Submatrix is Hard to Find,\u201d Operations Research Letters 1, 190\u2013193.","journal-title":"Operations Research Letters"},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/mnsc.34.3.342","volume":"34","author":"R. E. Bixby","year":"1988","unstructured":"Bixby, R. E., R. Fourer. 1988. \u201cFinding Embedded Network Rows in Linear Programs, I. Extraction Heuristics,\u201d Management Science, 34, 342\u2013376.","journal-title":"Management Science"},{"key":"14_CR9","doi-asserted-by":"crossref","first-page":"1166","DOI":"10.1287\/mnsc.26.11.1166","volume":"26","author":"G. Brown","year":"1980","unstructured":"Brown, G., D. Thomen. 1980. \u201cAutomatic Identification of Generalized Upper Bounds in Large-scale Optimization Models,\u201d Management Science, 26, 1166\u20131184.","journal-title":"Management Science"},{"key":"14_CR10","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01585656","volume":"32","author":"G. Brown","year":"1985","unstructured":"Brown, G., R. McBride, R. Wood. 1985. \u201cExtracting Embedded Generalized Networks from Linear Programming Problems,\u201d Mathematical Programming, 32, 11\u201331.","journal-title":"Mathematical Programming"},{"key":"14_CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02591728","volume":"29","author":"G. Brown","year":"1984","unstructured":"Brown, G., W. Wright. 1984. \u201cAutomatic Identification of Embedded Network Rows in Large-scale Optimization Models,\u201d Mathematical Programming, 29, 41\u201346.","journal-title":"Mathematical Programming"},{"issue":"Supp.1","key":"14_CR12","doi-asserted-by":"crossref","first-page":"S40","DOI":"10.1287\/opre.40.1.S40","volume":"40","author":"T. J. Chan","year":"1992","unstructured":"Chan, T. J., C. A. Yano. 1992. \u201cA Multiplier Adjustment Approach for the Set Partitioning Problem,\u201d Operations Research, 40, Supp. 1, S40\u2013S47.","journal-title":"Operations Research"},{"key":"14_CR13","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1287\/opre.25.5.760","volume":"25","author":"J. Etcheberry","year":"1977","unstructured":"Etcheberry, J. 1977. \u201cThe Set-Covering Problem: A New Implicit Enumeration Algorithm,\u201d Operations Research, 25, 760\u2013772.","journal-title":"Operations Research"},{"key":"14_CR14","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","volume":"36","author":"M. L. Fisher","year":"1990","unstructured":"Fisher, M. L., P. Kedia. 1990. \u201cOptimal Solution of Set Covering\/Partioning Problems Using Dual Heuristics,\u201d Management Science, 36, 674\u2013688.","journal-title":"Management Science"},{"key":"14_CR15","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0000(80)90042-2","volume":"21","author":"S. Fujishige","year":"1980","unstructured":"Fujishige, S. 1980. \u201cAn Efficient PQ-Graph Algorithm for Solving the Graph Realization Problem,\u201d Journal of Computer and System Sciences, 21, 63\u201386.","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR16","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.39.6.736","volume":"39","author":"G. Graves","year":"1993","unstructured":"Graves, G., R. McBride, I. Gershkoff, D. Anderson, D. Mahidhara. 1993. \u201cFlight Crew Scheduling,\u201d Management Science, 39, 736\u2013745.","journal-title":"Management Science"},{"key":"14_CR17","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/BF01584231","volume":"21","author":"G. Gunawardane","year":"1981","unstructured":"Gunawardane, G., S. Hoff, L. Schrage. 1981. \u201cIdentification of Special Structure Constraints in Linear Programs,\u201d Mathematical Programming, 21, 90\u201397.","journal-title":"Mathematical Programming"},{"key":"14_CR18","volume-title":"Algorithms to Extract Hidden Networks and Applications to Set Partitioning Problems","author":"H. Han","year":"1994","unstructured":"Han, Hyun-Soo, \u201cAlgorithms to Extract Hidden Networks and Applications to Set Partitioning Problems,\u201d unpublished dissertation, University of Massahusetts at Amherst, 1994."},{"key":"14_CR19","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1287\/mnsc.39.6.657","volume":"39","author":"K. L. Hoffman","year":"1993","unstructured":"Hoffman, K. L., M. Padberg. 1993. \u201cSolving Airline Crew-Scheduling Problems by Branch and Cut,\u201d Management Science, 39, 657\u2013682.","journal-title":"Management Science"},{"key":"14_CR20","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/mnsc.20.5.774","volume":"20","author":"R. E. Marsten","year":"1974","unstructured":"Marsten, R. E. 1974. \u201cAn Algorithm for Large Set Partitioning Problems,\u201d Management Science, 20, 191\u2013209.","journal-title":"Management Science"},{"key":"14_CR21","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1002\/nav.3800260401","volume":"26","author":"G. L. Nemhauser","year":"1979","unstructured":"Nemhauser, G. L., G. L. Weber. 1979. \u201cOptimal Set Partionings and Lagrangean Duality,\u201d Naval Research Logistics Quartely, 26, 553\u2013563.","journal-title":"Naval Research Logistics Quartely"},{"key":"14_CR22","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M. W. Padberg","year":"1973","unstructured":"Padberg, M. W. 1973. \u201cOn the Facial Structure of Set Packing Polyhedra,\u201d Mathematical Programming, 5, 199\u2013215.","journal-title":"Mathematical Programming"},{"key":"14_CR23","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1287\/mnsc.26.3.274","volume":"26","author":"F. Shepardson","year":"1980","unstructured":"Shepardson, F., R. E. Marsten. 1980. \u201cA Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem,\u201d Management Science, 26, 274\u2013281.","journal-title":"Management Science"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59408-6_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:27:18Z","timestamp":1619573238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59408-6_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540594086","9783540492450"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-59408-6_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}