{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T21:25:07Z","timestamp":1767907507454,"version":"3.49.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,3,10]],"date-time":"2010-03-10T00:00:00Z","timestamp":1268179200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s11590-010-0183-0","type":"journal-article","created":{"date-parts":[[2010,3,9]],"date-time":"2010-03-09T07:16:21Z","timestamp":1268118981000},"page":"559-565","source":"Crossref","is-referenced-by-count":5,"title":["Uniqueness of integer solution of linear equations"],"prefix":"10.1007","volume":"4","author":[{"given":"O. L.","family":"Mangasarian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. C.","family":"Ferris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,3,10]]},"reference":[{"key":"183_CR1","doi-asserted-by":"crossref","first-page":"1132","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E. Balas","year":"1980","unstructured":"Balas E., Zemel E.: An algorithm for large zero\u2013one knapsack problems. Oper. Res. 28, 1132\u20131154 (1980)","journal-title":"Oper. Res."},{"key":"183_CR2","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02241754","volume":"28","author":"D. Fayard","year":"1982","unstructured":"Fayard D., Plateau G.: An algorithm for the solution of the 0\u20131 knapsack problem. Computing 28, 269\u2013287 (1982)","journal-title":"Computing"},{"key":"183_CR3","volume-title":"Introduction to Global Optimization","author":"R. Horst","year":"1995","unstructured":"Horst R., Pardalos P., Thoai N.V.: Introduction to Global Optimization. Kluwer, Dodrecht (1995)"},{"key":"183_CR4","unstructured":"ILOG, Incline Village, Nevada. ILOG CPLEX 9.0 User\u2019s Manual (2003). http:\/\/www.ilog.com\/products\/cplex\/"},{"key":"183_CR5","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0024-3795(79)90014-4","volume":"25","author":"O.L. Mangasarian","year":"1979","unstructured":"Mangasarian O.L.: Uniqueness of solution in linear programming. Linear Algebra Appl. 25, 151\u2013162 (1979)","journal-title":"Linear Algebra Appl."},{"key":"183_CR6","unstructured":"Mangasarian, O.L.: Knapsack feasibility as an absolute value equation solvable by successive linear programming. Optim. Lett. 3, 161\u2013170 (2009). ftp:\/\/ftp.cs.wisc.edu\/pub\/dmi\/tech-reports\/08-03.pdf . Optimization Letters online version: http:\/\/www.springerlink.com\/content\/7011287432285747\/"},{"key":"183_CR7","unstructured":"Mangasarian, O.L., Recht, B.: Probability of unique integer solution to a system of linear equations. Technical Report 09-02, Data Mining Institute, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, September 2009. ftp:\/\/ftp.cs.wisc.edu\/pub\/dmi\/tech-reports\/09-02.pdf"},{"key":"183_CR8","unstructured":"MATLAB. User\u2019s Guide. The MathWorks, Inc., Natick (1994\u20132006). http:\/\/www.mathworks.com"},{"key":"183_CR9","unstructured":"Motzkin, T.S.: Beitr\u00e4ge zur Theorie der Linearen Ungleichungen. Inaugural Dissertation, Jerusalem (1936)"},{"key":"183_CR10","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: On the complexity of unique solution. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, pp. 14\u201320. IEEE CNF, Chicago (1982)","DOI":"10.1109\/SFCS.1982.28"},{"key":"183_CR11","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/j.orl.2004.05.011","volume":"33","author":"O.A. Prokopyev","year":"2005","unstructured":"Prokopyev O.A., Huang H.-X., Pardalos P.M.: On complexity of unconstrained hyperbolic 0-1 programming problems. Oper. Res. Lett. 33, 312\u2013318 (2005)","journal-title":"Oper. Res. Lett."},{"key":"183_CR12","doi-asserted-by":"crossref","unstructured":"Valiant, L.G., Vazirani, V.V.: Np is as easy as detecting unique solutions. In: Annual ACM Symposium on Theory of Computing, Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pp. 458\u2013463. Association for Computing Machinery, New York (1985)","DOI":"10.1145\/22145.22196"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0183-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-010-0183-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0183-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T15:15:04Z","timestamp":1559574904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-010-0183-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,10]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["183"],"URL":"https:\/\/doi.org\/10.1007\/s11590-010-0183-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,10]]}}}