{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T18:18:50Z","timestamp":1648837130261},"reference-count":37,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,5,1]],"date-time":"1995-05-01T00:00:00Z","timestamp":799286400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neurocomputing"],"published-print":{"date-parts":[[1995,5]]},"DOI":"10.1016\/0925-2312(94)00005-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:41:02Z","timestamp":1027629662000},"page":"51-78","source":"Crossref","is-referenced-by-count":2,"title":["Connectionist networks for pivot selection in linear programming"],"prefix":"10.1016","volume":"8","author":[{"given":"Angelo","family":"Monfroglio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-2312(94)00005-0_BIB1","article-title":"Disjunctive programming: Cutting planes from logical conditions","volume":"2","author":"Balas","year":"1975"},{"key":"10.1016\/0925-2312(94)00005-0_BIB2","author":"Berge","year":"1985"},{"key":"10.1016\/0925-2312(94)00005-0_BIB3","author":"Berge","year":"1989"},{"key":"10.1016\/0925-2312(94)00005-0_BIB4","series-title":"Advanced Techniques in O.R.","article-title":"Matroids and operations research","author":"Bixby","year":"1982"},{"key":"10.1016\/0925-2312(94)00005-0_BIB5","series-title":"Proc. 3rd Ann. ACM Symp. Theory Comput.","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0925-2312(94)00005-0_BIB6","article-title":"Maximum matching and polyhedron with 0,1-vertices","volume":"69","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bureau of Standards (B)"},{"key":"10.1016\/0925-2312(94)00005-0_BIB7","doi-asserted-by":"crossref","DOI":"10.1016\/0743-1066(89)90009-5","article-title":"Algorithms for testing the satisfiability of propositional formulae","volume":"7","author":"Gallo","year":"1989","journal-title":"J. Logic Programming"},{"key":"10.1016\/0925-2312(94)00005-0_BIB8","author":"Garey","year":"1979"},{"key":"10.1016\/0925-2312(94)00005-0_BIB9","series-title":"Linear Inequalities an Related Systems","article-title":"Integral boundary points of convex polyhedra","author":"Hoffman","year":"1956"},{"key":"10.1016\/0925-2312(94)00005-0_BIB10","doi-asserted-by":"crossref","DOI":"10.1016\/0167-6377(88)90044-2","article-title":"Resolution vs. cutting plane solution of inference problems: some computational experience","author":"Hooker","year":"1988"},{"key":"10.1016\/0925-2312(94)00005-0_BIB11","article-title":"The matching problem for bipartite graphs","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-2312(94)00005-0_BIB12","series-title":"Discrete Algorithms and Complexity","article-title":"Complimentary approaches to CNF Boolean equations","author":"Iwama","year":"1987"},{"key":"10.1016\/0925-2312(94)00005-0_BIB13","author":"Karloff","year":"1991"},{"key":"10.1016\/0925-2312(94)00005-0_BIB14","series-title":"Proc. 16th Annual ACM Symp. on Theory of Computing","article-title":"A new polynomial time algorithm for linear programming","author":"Karmarkar","year":"1984"},{"key":"10.1016\/0925-2312(94)00005-0_BIB15","series-title":"Complexity of Computer Computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0925-2312(94)00005-0_BIB16","article-title":"A polynomial algorithm for linear programming","author":"Khachian","year":"1979"},{"key":"10.1016\/0925-2312(94)00005-0_BIB17","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0004-3702(92)90003-G","article-title":"The logic of constraint satisfaction","volume":"Vol. 58","author":"Mackworth","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0925-2312(94)00005-0_BIB18","series-title":"Proc. Tenth Nat. Conf. on Artificial Intelligence (AAAI-92)","first-page":"459","article-title":"Hard and easy distributions for SAT problems","author":"Mitchell","year":"1992"},{"key":"10.1016\/0925-2312(94)00005-0_BIB19","series-title":"Atti Congresso Annuale A.I.C.A.","article-title":"Efficient logic constraint satisfaction","author":"Monfroglio","year":"1989"},{"key":"10.1016\/0925-2312(94)00005-0_BIB20","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(92)90389-W","article-title":"Integer programs for logic constraint satisfaction","volume":"97","author":"Monfroglio","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0925-2312(94)00005-0_BIB21","author":"Nemhauser","year":"1988"},{"key":"10.1016\/0925-2312(94)00005-0_BIB22","author":"Parker","year":"1988"},{"key":"10.1016\/0925-2312(94)00005-0_BIB23","doi-asserted-by":"crossref","DOI":"10.1016\/0095-8956(80)90075-1","article-title":"Decomposition of regular matroids","author":"Seymour","year":"1980","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0925-2312(94)00005-0_BIB24","doi-asserted-by":"crossref","DOI":"10.1137\/1010063","article-title":"Integral extreme points","volume":"10","author":"Veinott","year":"1968","journal-title":"SIAM Rev."},{"key":"10.1016\/0925-2312(94)00005-0_BIB25","author":"Welsh","year":"1976"},{"key":"10.1016\/0925-2312(94)00005-0_BIB26","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF01585727","article-title":"A \u2018build-down\u2019 scheme for linear programming","volume":"46","author":"Ye","year":"1990","journal-title":"Math. Programming"},{"key":"10.1016\/0925-2312(94)00005-0_BIB27","author":"Batchelor","year":"1974"},{"key":"10.1016\/0925-2312(94)00005-0_BIB28","article-title":"Adding a conscience to competitive learning","volume":"Vol. I","author":"DeSieno","year":"1988"},{"key":"10.1016\/0925-2312(94)00005-0_BIB29","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0893-6080(88)90003-2","article-title":"Increased rates of convergence through learning rate adaptation","volume":"1","author":"Jacobs","year":"1988","journal-title":"Neural Networks"},{"key":"10.1016\/0925-2312(94)00005-0_BIB30","author":"Klimasauskas","year":"1991"},{"key":"10.1016\/0925-2312(94)00005-0_BIB31","author":"Kohonen","year":"1988"},{"key":"10.1016\/0925-2312(94)00005-0_BIB32","first-page":"676","article-title":"Acceleration of back-propagation through learning rate and momentum adaptation","volume":"Vol. 1","author":"Minia","year":"1990"},{"issue":"1","key":"10.1016\/0925-2312(94)00005-0_BIB33","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0925-2312(91)90018-7","article-title":"Connectionist networks for constraint satisfaction","volume":"3","author":"Monfroglio","year":"1991","journal-title":"Neurocomputing"},{"key":"10.1016\/0925-2312(94)00005-0_BIB34","article-title":"Neural logic constraint solving","author":"Monfroglio","year":"1993","journal-title":"J. Parallel Distributed Processing"},{"key":"10.1016\/0925-2312(94)00005-0_BIB35","author":"Pao","year":"1989"},{"key":"10.1016\/0925-2312(94)00005-0_BIB36","article-title":"Back-propagation extensions","author":"Samad","year":"1989","journal-title":"Honeywell SSDC Tech. Rep."},{"key":"10.1016\/0925-2312(94)00005-0_BIB37","doi-asserted-by":"crossref","DOI":"10.1016\/0893-6080(90)90049-Q","article-title":"Probabilistic neural networks","author":"Specht","year":"1990","journal-title":"Neural Networks"}],"container-title":["Neurocomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925231294000050?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925231294000050?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T05:29:06Z","timestamp":1555824546000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925231294000050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,5]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,5]]}},"alternative-id":["0925231294000050"],"URL":"https:\/\/doi.org\/10.1016\/0925-2312(94)00005-0","relation":{},"ISSN":["0925-2312"],"issn-type":[{"value":"0925-2312","type":"print"}],"subject":[],"published":{"date-parts":[[1995,5]]}}}