{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T07:50:46Z","timestamp":1761292246357},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"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,5]]},"DOI":"10.1007\/bf01300969","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T01:11:38Z","timestamp":1111713098000},"page":"99-109","source":"Crossref","is-referenced-by-count":16,"title":["Reducing the number of variables in Integer and Linear Programming Problems"],"prefix":"10.1007","volume":"3","author":[{"given":"Djangir A.","family":"Babayev","sequence":"first","affiliation":[]},{"given":"Sahib S.","family":"Mardanov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"Methods for Reducing the Dimension of the Binary Programming Problems","author":"F.B. Akhmedov","year":"1985","unstructured":"F.B. Akhmedov, ?Methods for Reducing the Dimension of the Binary Programming Problems,? Dissertation for the degree of The Candidate of Physico-Mathematical Sciences Institute of Cybernetics of The Academy of Sciences of Azerbaijan, Baku, 1985 (Russian)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BF01580428","volume":"8","author":"A.L. Brearly","year":"1975","unstructured":"A.L. Brearly, G. Mitra, and H.P. Williams, ?Analysis of Mathematical Programming Problems Prior to Applying the Simplex Algorithm,? Mathematical Programming,8, (1975), 54?83.","journal-title":"Mathematical Programming"},{"issue":"N5","key":"CR3","first-page":"266","volume":"5","author":"H. Crowder","year":"1983","unstructured":"H. Crowder, E.L., Johnson, and M. Padberg ?Solving Large-Scale Zero-One Linear Programming Problems? Operat. Res. 1983, v 5, N5, 266?277.","journal-title":"Operat. Res."},{"key":"CR4","first-page":"103","volume":"3","author":"I.V. Danilchenko","year":"1980","unstructured":"I.V. Danilchenko, Yu.M. Makarenkov, and E.F. Pshennova, ?A Method of Preliminary Reducing the Dimension of the Linear Programming Problem with Non-negative Constraints Matrix,? Cybernetics, 1980, N 3, 103?106 (Translated from Russian).","journal-title":"Cybernetics"},{"key":"CR5","series-title":"Discrete Optimization II. Ann. Discrete Math.","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0167-5060(08)70353-4","volume-title":"Report of the Session of Current State of Computer Codes for Discrete Optimization","author":"J.J. Forrest","year":"1979","unstructured":"J.J. Forrest, ?Report of the Session of Current State of Computer Codes for Discrete Optimization,? Discrete Optimization II. Ann. Discrete Math.,5, Amsterdam: North-Holland, 1979, 271?274."},{"key":"CR6","volume-title":"Kanpsack Problems. Algorithms and Computer implementations","author":"Martello Silvano and Toth Paolo","year":"1990","unstructured":"Martello Silvano and Toth Paolo. ?Kanpsack Problems. Algorithms and Computer implementations,? John Wiley & Sons, New York 1990, 296 pp."},{"key":"CR7","first-page":"40","volume":"32","author":"L.A. Oley","year":"1983","unstructured":"L.A. Oley and R.J. Sjoquist, ?Automatic Reformulation of Mixed and Pure Integer Models to Reduce Solution Time in APEX IV,? SIGMAP BULL., April 1983, N 32, 40?51.","journal-title":"SIGMAP BULL."},{"key":"CR8","series-title":"Discrete Optimization II. Ann. Discrete Math.","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0167-5060(08)70355-8","volume-title":"Report of the Session on Current Computer Codes for Discrete Optimization","author":"S. Powell","year":"1979","unstructured":"S. Powell, ?Report of the Session on Current Computer Codes for Discrete Optimization,? Discrete Optimization II. Ann. Discrete Math.,5, Amsterdam: North-Holland 1979, 279?283."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BFb0120693","volume":"2","author":"H.P. Williams","year":"1974","unstructured":"H.P. Williams. ?Experiments in the Formulation of Integer Programming Problems?, Math. Program. Study, 1974, N 2, 180?197.","journal-title":"Math. Program. Study"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01300969.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01300969\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01300969","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T14:08:23Z","timestamp":1556633303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01300969"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["BF01300969"],"URL":"https:\/\/doi.org\/10.1007\/bf01300969","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}