{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:15:20Z","timestamp":1773656120024,"version":"3.50.1"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[1972,6,1]],"date-time":"1972-06-01T00:00:00Z","timestamp":76204800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1972,6]]},"DOI":"10.1109\/tc.1972.5009010","type":"journal-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T20:36:47Z","timestamp":1243975007000},"page":"573-582","source":"Crossref","is-referenced-by-count":26,"title":["Design of Optimal Switching Networks by Integer Programming"],"prefix":"10.1109","volume":"C-21","author":[{"given":"Saburo","family":"Muroga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshihide","family":"Ibaraki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","author":"swee","year":"1970","journal-title":"Optimum network design using NOR-OR gates by integer programming"},{"key":"ref32","first-page":"47","article-title":"complex gates in digital systems design","volume":"2","author":"spencer","year":"1969","journal-title":"IEEE Comput Group News"},{"key":"ref31","author":"shiau","year":"1971","journal-title":"Design of optimal one-bit adder networks by integer programming"},{"key":"ref30","author":"nakagawa","year":"1971","journal-title":"A branch-and-bound algorithm for optimal AND-OR networks"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1965.264081"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1969.222521"},{"key":"ref12","first-page":"632","article-title":"optimal multiplier trees of carry-save adders with mixed delay","volume":"2","author":"freiman","year":"1965","journal-title":"Proc IFIP Congress 65"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1009031"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1967.264603"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/opre.13.6.879"},{"key":"ref16","author":"gomory","year":"1963","journal-title":"Industrial Scheduling"},{"key":"ref17","author":"hartmanis","year":"1966","journal-title":"Algebraic Structure Theory of Sequtential Machines"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1963.263531"},{"key":"ref19","author":"ibaraki","year":"1969","journal-title":"Implicit enumeration program for zero-one integer programming"},{"key":"ref28","author":"muroga","year":"1968","journal-title":"Logical design of an optimum network by integer linear programming?Part I"},{"key":"ref4","author":"baugh","year":"1969","journal-title":"An optimum network design using NOR and NOR-AND gates by integer pro-gramming"},{"key":"ref27","author":"muroga","year":"1971","journal-title":"Threshold Logic"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.19.4.1090"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/321556.321572"},{"key":"ref29","author":"muroga","year":"1968","journal-title":"Logical design of an optimum network by integer linear programming?Part II"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1965.264120"},{"key":"ref8","author":"chandersekaran","year":"1970","journal-title":"Synthesis of optimal double-rail logic net-works using NOR-OR gates by integer programming"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1964.263921"},{"key":"ref2","author":"baugh","year":"1968","journal-title":"Comuputational experi-ence in all-integer binary-variable integer-programming problems using Gomory's all-integer algorithm"},{"key":"ref9","author":"davidson","year":"1968","journal-title":"An algorithm for NAND decomposition of combinational switching functions"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.13.4.517"},{"key":"ref20","volume":"1","year":"0","journal-title":"International Journal of Computer and Information Sciences"},{"key":"ref22","first-page":"55","article-title":"general theory of com-plete sets of logical functions","volume":"46","author":"ibuki","year":"1963","journal-title":"Electron Commun in Japan (IEEE translation)"},{"key":"ref21","author":"ibaraki","year":"1971","journal-title":"Synthesis of optimal networks with NOR and NAND gates by integer pro-gramming"},{"key":"ref24","author":"liu","year":"1968","journal-title":"A code for zero-one integer linear programming by implicit enumeration"},{"key":"ref23","article-title":"a table of four-variable minimal nand circuits","author":"ikeno","year":"1968","journal-title":"Elec Commun Lab Tech J"},{"key":"ref26","author":"mccluskey","year":"1965","journal-title":"Introduction to the Theory of Switching Circuits"},{"key":"ref25","year":"1968"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/5009001\/05009010.pdf?arnumber=5009010","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:39:18Z","timestamp":1638218358000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5009010\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972,6]]},"references-count":33,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tc.1972.5009010","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[1972,6]]}}}