{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T21:55:48Z","timestamp":1648936548519},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1979,12,1]],"date-time":"1979-12-01T00:00:00Z","timestamp":312854400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1979,12]]},"DOI":"10.1007\/bf01582107","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T04:28:41Z","timestamp":1114662521000},"page":"177-189","source":"Crossref","is-referenced-by-count":0,"title":["Preventing redundant solutions in partial enumeration algorithms"],"prefix":"10.1007","volume":"16","author":[{"given":"J. Randall","family":"Brown","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Subductive programming and chromatic scheduling","author":"J.R. Brown","year":"1970","unstructured":"J.R. Brown, \u201cSubductive programming and chromatic scheduling\u201d, Dissertation, Massachusetts Institute of Technology, Cambridge, MA (1970)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1287\/mnsc.19.4.456","volume":"19","author":"J.R. Brown","year":"1972","unstructured":"J.R. Brown, \u201cChromatic scheduling and the chromatic number problem\u201d,Management Science 19 (1972) 456\u2013463.","journal-title":"Management Science"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1002\/net.3230030407","volume":"3","author":"J.R. Brown","year":"1973","unstructured":"J.R. Brown, \u201cThe chromatic reduction problem\u201d,Networks 3 (1973) 367\u2013377.","journal-title":"Networks"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1287\/mnsc.17.5.259","volume":"17","author":"S. Eilon","year":"1971","unstructured":"S. Eilon and N. Christofides, \u201cThe loading problem\u201d,Management Science 17 (1971) 259\u2013268.","journal-title":"Management Science"},{"key":"CR5","first-page":"178","volume":"9","author":"A. Geoffrion","year":"1967","unstructured":"A. Geoffrion, \u201cInteger programming by implicit enumeration and Balas' method\u201d,Society of Industrial and Applied Mathematics Review 9 (1967) 178\u2013190.","journal-title":"Society of Industrial and Applied Mathematics Review"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1145\/321296.321300","volume":"12","author":"S.W. Golomb","year":"1965","unstructured":"S.W. Golomb and L.D. Baumert, \u201cBacktrack programming\u201d,Journal of the Association of Computing Machinery 12 (1965) 516\u2013524.","journal-title":"Journal of the Association of Computing Machinery"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"M.S. Hung and J.R. Brown, \u201cAn algorithm for a class of loading problems\u201d,Naval Research Logistics Quarterly, to appear.","DOI":"10.1002\/nav.3800250209"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1287\/opre.11.6.972","volume":"11","author":"J.D.C. Little","year":"1963","unstructured":"J.D.C. Little, K.G. Murty, D.W. Sweeney and C. Karel, \u201cAn algorithm for the traveling salesman problem\u201d,Operations Research 11 (1963) 972\u2013989.","journal-title":"Operations Research"},{"key":"CR9","unstructured":"M.J. Rossman and R.J. Twery, \u201cCombinatorial programming\u201d, Paper presented at the 6th Annual Meeting of the Operations Research Society of America, Boston, MA (1958)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582107.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582107\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:15:45Z","timestamp":1556882145000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,12]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,12]]}},"alternative-id":["BF01582107"],"URL":"https:\/\/doi.org\/10.1007\/bf01582107","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,12]]}}}