{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T22:40:37Z","timestamp":1648680037165},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ZOR - Methods and Models of Operations Research"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1007\/bf01415956","type":"journal-article","created":{"date-parts":[[2005,4,3]],"date-time":"2005-04-03T19:18:00Z","timestamp":1112555880000},"page":"1-13","source":"Crossref","is-referenced-by-count":1,"title":["A finite cutting plane method for facial disjunctive programs"],"prefix":"10.1007","volume":"35","author":[{"given":"J.","family":"F\ufffdl\ufffdp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Balas E (1974) Disjunctive programming: Properties of the convex hull of feasible points. MSRR 384, GSIA, Carnegie-Mellon University"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1137\/0128029","volume":"28","author":"E Balas","year":"1975","unstructured":"Balas E (1975) Nonconvex programming via generalized polars. SIAM Journal on Applied Mathematics 28: 335?349","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E Balas","year":"1979","unstructured":"Balas E (1979) Disjunctive programming. Annals of Discrete Mathematics 5: 3?51","journal-title":"Annals of Discrete Mathematics"},{"key":"CR4","volume-title":"Linear Programming: Active Set Analysis and Computer Programs","author":"MJ Best","year":"1985","unstructured":"Best MJ, Ritter K (1985) Linear Programming: Active Set Analysis and Computer Programs. Prentice-Hall, Englewood Cliffs, New Jersey"},{"key":"CR5","first-page":"440","volume":"68","author":"J F\u00fcl\u00f6p","year":"1988","unstructured":"F\u00fcl\u00f6p J (1988) The transformation of the linear disjunctive programming problem into a facial problem. Zeitschrift f\u00fcr Angewandte Mathematik und Mechanik 68: 440?441","journal-title":"Zeitschrift f\u00fcr Angewandte Mathematik und Mechanik"},{"key":"CR6","first-page":"161","volume-title":"Mathematical Programming in Theory and Practice","author":"F Gianessi","year":"1974","unstructured":"Gianessi F, Tomasin E (1974) Nonconvex quadratic programs, linear complementarity problems, and integer linear programs. In: Hammer PL, Zoutendijk G (eds.), Mathematical Programming in Theory and Practice, North-Holland, Amsterdam: 161?199"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1137\/0316005","volume":"16","author":"RG Jeroslow","year":"1978","unstructured":"Jeroslow RG (1978) Cutting planes for the complementarity constraints. SIAM Journal on Control and Optimization 16: 56?62","journal-title":"SIAM Journal on Control and Optimization"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/0318018","volume":"18","author":"RG Jeroslow","year":"1980","unstructured":"Jeroslow RG (1980) A cutting plane game for facial disjunctive programs. SIAM Journal on Control and Optimization 18: 264?281","journal-title":"SIAM Journal on Control and Optimization"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1287\/opre.27.3.516","volume":"27","author":"PF Kough","year":"1979","unstructured":"Kough PF (1979) The indefinite quadratic programming problem. Operations Research 27: 516?533","journal-title":"Operations Research"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1287\/moor.5.2.167","volume":"5","author":"TH Mattheis","year":"1980","unstructured":"Mattheis TH, Rubin DS (1980) A survey and comparison of methods for finding all vertices of convex polyhedrical sets. Mathematics of Operations Research 5: 167?185","journal-title":"Mathematics of Operations Research"},{"key":"CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48794-1","volume-title":"Optimization with Disjunctive Constraints","author":"HD Sherali","year":"1980","unstructured":"Sherali HD, Shetty CM (1980) Optimization with Disjunctive Constraints. Springer, New York"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0166-218X(82)90071-3","volume":"4","author":"HD Sherali","year":"1982","unstructured":"Sherali HD, Shetty CM (1982) A finitely convergent procedure for facial disjunctive programs. Discrete Applied Mathematics 4: 135?148","journal-title":"Discrete Applied Mathematics"},{"key":"CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-46216-0","volume-title":"Convexity and Optimization in Finite Dimensions","author":"J Stoer","year":"1970","unstructured":"Stoer J, Witzgall C (1970) Convexity and Optimization in Finite Dimensions. Springer, New York"},{"key":"CR14","volume-title":"Model Building in Mathematical Programming","author":"HP Williams","year":"1978","unstructured":"Williams HP (1978) Model Building in Mathematical Programming, Wiley, New York"}],"container-title":["ZOR Zeitschrift f\ufffdr Operations Research Methods and Models of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01415956.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01415956\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01415956","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:12:38Z","timestamp":1556817158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01415956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["BF01415956"],"URL":"https:\/\/doi.org\/10.1007\/bf01415956","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}