{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:39Z","timestamp":1759063599614},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"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":[[1996,11]]},"DOI":"10.1007\/bf00247796","type":"journal-article","created":{"date-parts":[[2011,11,9]],"date-time":"2011-11-09T02:51:24Z","timestamp":1320807084000},"page":"293-303","source":"Crossref","is-referenced-by-count":2,"title":["Using dual network bounds in algorithms for solving generalized set packing partitioning problems"],"prefix":"10.1007","volume":"6","author":[{"given":"N. Z.","family":"Shor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu. V.","family":"Voitishin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. M.","family":"Glushkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF00247796_CR1","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1137\/1018115","volume":"18","author":"E. Balas","year":"1976","unstructured":"E. Balas and M.W. Padberg, \u201cSet partitioning: A survey,\u201d SIAM Rev., vol. 18, pp. 710\u2013760, 1976.","journal-title":"SIAM Rev."},{"key":"BF00247796_CR2","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1287\/mnsc.16.11.652","volume":"16","author":"A.M. Geoffrion","year":"1970","unstructured":"A.M. Geoffrion, \u201cElements of large-scale mathematical programming,\u201d Management Sci., vol. 16, pp. 652\u2013691, 1970.","journal-title":"Management Sci."},{"key":"BF00247796_CR3","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"R.M. Karp","year":"1975","unstructured":"R.M. Karp, \u201cOn the computational complexity of combinatorial problems,\u201d Networks, vol. 5, pp. 45\u201368, 1975.","journal-title":"Networks"},{"key":"BF00247796_CR4","unstructured":"A. Kaufmann and A. Henri-Laborder, Methods, and Models of Operation Research, Mir: Moscow, 1977 (in Russian)."},{"key":"BF00247796_CR5","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1287\/mnsc.20.5.774","volume":"20","author":"R.E. Marsten","year":"1974","unstructured":"R.E. Marsten, \u201cAn algorithm for large set partitioning problems,\u201d Management Sci., vol. 20, pp. 774\u2013787, 1974.","journal-title":"Management Sci."},{"key":"BF00247796_CR6","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1002\/nav.3800260401","volume":"26","author":"G.L. Nemhauser","year":"1979","unstructured":"G.L. Nemhauser and G.M. Weber, \u201cOptimal set partitioning, matchings and Lagrangian duality,\u201d Nav. Res. Q., vol. 26, pp. 553\u2013563, 1979.","journal-title":"Nav. Res. Q."},{"key":"BF00247796_CR7","doi-asserted-by":"crossref","first-page":"160","DOI":"10.4153\/CJM-1971-016-5","volume":"23","author":"A. Pnueli","year":"1971","unstructured":"A. Pnueli, A. Lembel, and S. Even \u201cTransitive orientation of graph and identification of permutation graph,\u201d Can. J. Math., vol. 23, pp. 160\u2013175, 1971.","journal-title":"Can. J. Math."},{"key":"BF00247796_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82118-9","volume-title":"Minimization Methods for Non-Differentiable Functions","author":"N.Z. Shor","year":"1985","unstructured":"N.Z. Shor, Minimization Methods for Non-Differentiable Functions, Springer-Verlag: Berlin, 1985."},{"key":"BF00247796_CR9","volume-title":"Quadratic Extremal Problems and Nondifferentiable Optimization","author":"N.Z. Shor","year":"1989","unstructured":"N.Z. Shor and S.I. Stetsenko, Quadratic Extremal Problems and Nondifferentiable Optimization, Naukova Dumka: Kiev, 1989 (in Russian)."},{"key":"BF00247796_CR10","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/BF01130355","volume":"27","author":"Yu. V. Voitishin","year":"1990","unstructured":"Yu. V. Voitishin \u201cAlgorithms to find the maximum set of pairwise incomparable weighted vertices in a directed acyclic graph,\u201d Cybernet. Syst. Anal., vol. 27, pp. 475\u2013480, 1990.","journal-title":"Cybernet. Syst. Anal."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00247796.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00247796\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00247796","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T08:05:07Z","timestamp":1560931507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00247796"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["BF00247796"],"URL":"https:\/\/doi.org\/10.1007\/bf00247796","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}