{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T11:59:42Z","timestamp":1759838382759,"version":"3.37.3"},"reference-count":62,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,12,15]],"date-time":"2020-12-15T00:00:00Z","timestamp":1607990400000},"content-version":"vor","delay-in-days":1475,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational and Applied Mathematics"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1016\/j.cam.2016.05.006","type":"journal-article","created":{"date-parts":[[2016,5,31]],"date-time":"2016-05-31T20:20:13Z","timestamp":1464726013000},"page":"346-360","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Extending linear relaxation for non-square matrices and soft constraints"],"prefix":"10.1016","volume":"308","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0697-9187","authenticated-orcid":false,"given":"Noreen","family":"Jamil","sequence":"first","affiliation":[]},{"given":"Johannes","family":"M\u00fcller","sequence":"additional","affiliation":[]},{"given":"M. Asif","family":"Naeem","sequence":"additional","affiliation":[]},{"given":"Christof","family":"Lutteroth","sequence":"additional","affiliation":[]},{"given":"Gerald","family":"Weber","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cam.2016.05.006_br000005","unstructured":"A.B. Saeed, A.B. Naeem, Numerical Analysis, Shahryar, 2008."},{"issue":"6","key":"10.1016\/j.cam.2016.05.006_br000010","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/s10208-007-9005-x","article-title":"Random sampling of sparse trigonometric polynomials, ii. Orthogonal matching pursuit versus basis pursuit","volume":"8","author":"Kunis","year":"2008","journal-title":"J. Found. Comput. Math."},{"year":"2002","series-title":"Numerical Methods for Scientist and Engineers","author":"Anita","key":"10.1016\/j.cam.2016.05.006_br000015"},{"key":"10.1016\/j.cam.2016.05.006_br000020","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1006\/jcph.2002.7176","article-title":"Preconditioning techniques for large linear systems: A survey","volume":"182","author":"Benzi","year":"2002","journal-title":"J. Comput. Phys."},{"issue":"3","key":"10.1016\/j.cam.2016.05.006_br000025","first-page":"223","article-title":"Constraint hierarchies","volume":"5","author":"Borning","year":"1992","journal-title":"Lisp Symb. Comput."},{"key":"10.1016\/j.cam.2016.05.006_br000030","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1287\/ijoc.13.3.210.12632","article-title":"Fast heuristics for the maximum feasible subsystem problem","author":"Chinneck","year":"2001","journal-title":"Inf. J. Comput."},{"issue":"4","key":"10.1016\/j.cam.2016.05.006_br000035","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1145\/504704.504705","article-title":"The cassowary linear arithmetic constraint solving algorithm","volume":"8","author":"Badros","year":"2001","journal-title":"ACM Trans. Comput.\u2013Hum. Interact."},{"key":"10.1016\/j.cam.2016.05.006_br000040","series-title":"Proceedings of the 10th Annual ACM Symposium on User Interface Software and Technology","first-page":"87","article-title":"Solving linear arithmetic constraints for user interface applications","author":"Borning","year":"1997"},{"key":"10.1016\/j.cam.2016.05.006_br000045","unstructured":"M.S. Bazaraa, J.J. Jarvis, H.D. Sherali, Linear Programming and Network Flows, 1990."},{"key":"10.1016\/j.cam.2016.05.006_br000050","series-title":"Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming","first-page":"340","article-title":"A tableau based constraint solving toolkit for interactive graphical applications","author":"Marriott","year":"1998"},{"key":"10.1016\/j.cam.2016.05.006_br000055","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/j.cam.2015.04.014","article-title":"Randomized hildreth\u2019s algorithm with applications to soft constraints for user interface layout","volume":"288","author":"Jamil","year":"2015","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.cam.2016.05.006_br000060","unstructured":"J. Stuart, Linprog: http:\/\/www.mathworks.com\/matlabcentral\/fileexchange\/97-linprog\/."},{"key":"10.1016\/j.cam.2016.05.006_br000065","unstructured":"M. Berkelaar, P. Notebaert, K. Eikland, A (mixed integer) linear programming problem solver: http:\/\/lpsolve.sourceforge.net\/."},{"key":"10.1016\/j.cam.2016.05.006_br000070","unstructured":"Apache Software Foundation, 2012. Commons math, release 2.1; http:\/\/commons.apache.org\/math."},{"key":"10.1016\/j.cam.2016.05.006_br000075","doi-asserted-by":"crossref","unstructured":"C. Lutteroth, R. Strandh, G. Weber, Domain specific high-level constraints for user interface layout, Constraints, Vol. 13, no. 3.","DOI":"10.1007\/s10601-008-9043-2"},{"year":"1971","series-title":"Iterative Solution of Large Linear Systems","author":"Young","key":"10.1016\/j.cam.2016.05.006_br000080"},{"year":"1995","series-title":"Numerical Linear Algebra and Applications","author":"Datta","key":"10.1016\/j.cam.2016.05.006_br000085"},{"key":"10.1016\/j.cam.2016.05.006_br000090","series-title":"Iterative Methods for Sparse Linear Systems","first-page":"112","author":"Saad","year":"2003"},{"year":"2001","series-title":"A scaling algorithm to equilibrate both rows and columns norms in matrices, Tech. Rep.","author":"Ruiz","key":"10.1016\/j.cam.2016.05.006_br000095"},{"year":"1999","series-title":"On algorithms for permuting large entries to the diagonal of a sparse matrix, Tech. Rep.","author":"Duff","key":"10.1016\/j.cam.2016.05.006_br000100"},{"issue":"3","key":"10.1016\/j.cam.2016.05.006_br000105","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/moor.5.3.388","article-title":"The relaxation method for solving systems of linear inequalities","volume":"5","author":"Goffin","year":"1980","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.cam.2016.05.006_br000110","doi-asserted-by":"crossref","first-page":"382","DOI":"10.4153\/CJM-1954-037-2","article-title":"The relaxation method for linear inequalities","author":"Agmon","year":"1954","journal-title":"Canad. J. Math."},{"key":"10.1016\/j.cam.2016.05.006_br000115","doi-asserted-by":"crossref","first-page":"393","DOI":"10.4153\/CJM-1954-038-x","article-title":"The relaxation method for linear inequalities","author":"Motzkin","year":"1954","journal-title":"Canad. J. Math."},{"year":"2005","series-title":"Numerical Analysis","author":"Burden","key":"10.1016\/j.cam.2016.05.006_br000120"},{"year":"1997","series-title":"Scientific Computing, An Introductory Survey","author":"Heath","key":"10.1016\/j.cam.2016.05.006_br000125"},{"key":"10.1016\/j.cam.2016.05.006_br000130","first-page":"501","article-title":"Modifications of the normal equations method that are numerically stable, In Numerical Linear Algebra","author":"Foster","year":"1991","journal-title":"Digit. Signal Process. Parallel Algorithms"},{"year":"1996","series-title":"Iterative Solution Methods","author":"Axelsson","key":"10.1016\/j.cam.2016.05.006_br000135"},{"year":"1998","series-title":"Linear Programming and Extensions","author":"Dantzig","key":"10.1016\/j.cam.2016.05.006_br000140"},{"year":"1992","series-title":"Operations Research: An Introduction","author":"Taha","key":"10.1016\/j.cam.2016.05.006_br000145"},{"issue":"3","key":"10.1016\/j.cam.2016.05.006_br000150","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1137\/0907058","article-title":"Gmres: a generalized minimal residual algorithm for solving nonsymmetric linear systems","volume":"7","author":"Saad","year":"1986","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"10.1016\/j.cam.2016.05.006_br000155","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","article-title":"Methods of conjugate gradients for solving linear systems","volume":"49","author":"Hestenes","year":"1952","journal-title":"J. Res. Natl. Bur. Stand."},{"year":"1996","series-title":"Matrix Computations","author":"Golub","key":"10.1016\/j.cam.2016.05.006_br000160"},{"key":"10.1016\/j.cam.2016.05.006_br000165","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.sysconle.2004.06.008","article-title":"Iterative least-squares solutions of coupled sylvester matrix equations","volume":"54","author":"Ding","year":"2005","journal-title":"Systems Control Lett."},{"issue":"1","key":"10.1016\/j.cam.2016.05.006_br000170","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1023\/A:1021902812784","article-title":"Current approaches for solving over-constrained problems","volume":"8","author":"Meseguer","year":"2003","journal-title":"Constraints"},{"issue":"1","key":"10.1016\/j.cam.2016.05.006_br000175","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1023\/A:1021946627805","article-title":"A foundation of solution methods for constraint hierarchies","volume":"8","author":"Hosobe","year":"2003","journal-title":"Constraints"},{"key":"10.1016\/j.cam.2016.05.006_br000180","unstructured":"E.C. Freuder, Partial constraint satisfaction, in: International Joint Conference on Artificial Intelligence, 1989, pp. 278\u2013283."},{"key":"10.1016\/j.cam.2016.05.006_br000185","doi-asserted-by":"crossref","unstructured":"C. Zeidler, C. Lutteroth, G. Weber, Constraint solving for beautiful user interfaces: How solving strategies support layout aesthetics, in: Proceedings of CHINZ, 2012, pp. 23\u201332.","DOI":"10.1145\/2379256.2379268"},{"key":"10.1016\/j.cam.2016.05.006_br000190","series-title":"Proceedings of the IEEE International Conference on Shape Modeling and Applications 2006","first-page":"23","article-title":"A constrained least squares approach to interactive mesh deformation","author":"Yoshioka","year":"2006"},{"key":"10.1016\/j.cam.2016.05.006_br000195","series-title":"Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming","first-page":"218","article-title":"A scalable linear constraint solver for user interface construction","author":"Hosobe","year":"2000"},{"key":"10.1016\/j.cam.2016.05.006_br000200","doi-asserted-by":"crossref","unstructured":"H. Hosobe, A simplex-based scalable linear constraint solver for user interface applications, in: 2011 23rd IEEE International Conference on Tools with Artificial Intelligence, ICTAI, 2011, pp. 793\u2013798. http:\/\/dx.doi.org\/10.1109\/ICTAI.2011.124.","DOI":"10.1109\/ICTAI.2011.124"},{"issue":"1","key":"10.1016\/j.cam.2016.05.006_br000205","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1145\/76372.77531","article-title":"An incremental constraint solver","volume":"33","author":"Freeman-Benson","year":"1990","journal-title":"Commun. ACM"},{"key":"10.1016\/j.cam.2016.05.006_br000210","series-title":"Proceedings of the 7th Annual ACM Symposium on User Interface Software and Technology","first-page":"137","article-title":"Skyblue: a multi-way local propagation constraint solver for user interface construction","author":"Sannella","year":"1994"},{"key":"10.1016\/j.cam.2016.05.006_br000215","series-title":"Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming","first-page":"51","article-title":"Locally simultaneous constraint satisfaction","author":"Hosobe","year":"1994"},{"key":"10.1016\/j.cam.2016.05.006_br000220","doi-asserted-by":"crossref","unstructured":"N. Jamil, J. M\u00fcller, D. Needell, C. Lutteroth, G. Weber, Kaczmarz algorithm with soft constraints for user interface layout, in: Proceedings of 25th International Conference on Tools with Artificial Intelligence, ICTAI, 2013, pp. 818\u2013824.","DOI":"10.1109\/ICTAI.2013.125"},{"key":"10.1016\/j.cam.2016.05.006_br000225","unstructured":"U. Junker, Quickxplain: preferred explanations and relaxations for over-constrained problems, in: Proceedings of the 19th national conference on Artifical intelligence, 2004, pp. 167\u2013172."},{"key":"10.1016\/j.cam.2016.05.006_br000230","series-title":"SAT","first-page":"467","article-title":"Exploiting cycle structures in max-sat","volume":"5584","author":"Li","year":"2009"},{"key":"10.1016\/j.cam.2016.05.006_br000235","doi-asserted-by":"crossref","unstructured":"F. Heras, J. Larrosa, A. Oliveras, Minimaxsat: a new weighted max-sat solver, in: International Conference on Theory and Applications of Satisfiability Testing, 2007, pp. 41\u201355.","DOI":"10.1007\/978-3-540-72788-0_8"},{"key":"10.1016\/j.cam.2016.05.006_br000240","unstructured":"H. Lin, K. Su, C.M. Li, Within-problem learning for efficient lower bound computation in max-sat solving, in: International Conference on Theory and Applications of Satisfiability Testing, 2008, pp. 351\u2013356."},{"key":"10.1016\/j.cam.2016.05.006_br000245","unstructured":"D.L. Berre, Sat4jmaxsat, a satisfability library for java: 2008. http:\/\/sat4j.org\/."},{"key":"10.1016\/j.cam.2016.05.006_br000250","doi-asserted-by":"crossref","unstructured":"V.M. Manquinho, J.P.M. Silva, J. Planes, Algorithms for weighted boolean optimization, in: Procedings of the 20th International Conference on Theory and Applications of Satisfiability Testing, 2009, pp. 495\u2013508.","DOI":"10.1007\/978-3-642-02777-2_45"},{"key":"10.1016\/j.cam.2016.05.006_br000255","unstructured":"C. Ans\u00f3tegui, M.L. Bonet, J. Levy, Solving (weighted) partial maxsat through satisfiability testing, in: Procedings of the 20th International Conference on Theory and Applications of Satisfiability Testing, Vol. 5584, 2009, pp. 427\u2013440."},{"key":"10.1016\/j.cam.2016.05.006_br000260","unstructured":"C. Ans\u00f3tegui, M.L. Bonet, J. Levy, A new algorithm for weighted partial maxsat, in: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence."},{"year":"1994","series-title":"From Finding Maximum Feasible Subsystems of Linear Systems to Feed-forward Neural Network Design","author":"Amaldi","key":"10.1016\/j.cam.2016.05.006_br000265"},{"key":"10.1016\/j.cam.2016.05.006_br000270","doi-asserted-by":"crossref","first-page":"1465","DOI":"10.1016\/j.cor.2007.04.001","article-title":"A two-phase relaxation-based heuristic for the maximum feasible subsystem problem","author":"Amaldi","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cam.2016.05.006_br000275","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF01096681","article-title":"Misclassification minimization","author":"Mangasarian","year":"1994","journal-title":"J. Global Optim."},{"key":"10.1016\/j.cam.2016.05.006_br000280","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/050645828","article-title":"Branch and cut for the maximum feasible subsystemproblem","author":"Pfetsch","year":"2008","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2016.05.006_br000285","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1287\/ijoc.3.2.157","article-title":"Locating minimal infeasible constraint sets in linear programs","author":"Chinneck","year":"1991","journal-title":"ORSA J. Comput."},{"key":"10.1016\/j.cam.2016.05.006_br000290","unstructured":"R. Bakker, F. Dikker, F. Tempelman, P. Wogmim, Diagnosing and solving over-determined constraint satisfaction problems, in: International Joint Conference on Artificial Intelligence, 1993, pp. 276\u2013281."},{"year":"1995","series-title":"Resolving inconsistency in infeasible linear programmes, Tech. rep.","author":"Tamiz","key":"10.1016\/j.cam.2016.05.006_br000295"},{"key":"10.1016\/j.cam.2016.05.006_br000300","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0305-0548(95)00018-H","article-title":"Detecting iis in infeasible linear programmes using techniques from goal programming","author":"Tamiz","year":"1996","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cam.2016.05.006_br000305","unstructured":"C.L.G.W. Noreen Jamil, Johannes M\u00fcller, Extending linear relaxation for user interface layout, in: Proceedings of 24th International Conference on Tools with Artificial Intelligence, ICTAI, 2012, pp. 1\u20138."},{"key":"10.1016\/j.cam.2016.05.006_br000310","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1287\/ijoc.11.1.63","article-title":"Analyzing infeasible mixed-integer and integer linear programs","author":"Guieu","year":"1999","journal-title":"INFORMS J. Comput."}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042716302230?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042716302230?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,12,16]],"date-time":"2020-12-16T16:32:22Z","timestamp":1608136342000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377042716302230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":62,"alternative-id":["S0377042716302230"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2016.05.006","relation":{},"ISSN":["0377-0427"],"issn-type":[{"type":"print","value":"0377-0427"}],"subject":[],"published":{"date-parts":[[2016,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Extending linear relaxation for non-square matrices and soft constraints","name":"articletitle","label":"Article Title"},{"value":"Journal of Computational and Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cam.2016.05.006","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}