{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:29:47Z","timestamp":1775579387652,"version":"3.50.1"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T00:00:00Z","timestamp":1304553600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s10472-011-9233-2","type":"journal-article","created":{"date-parts":[[2011,5,4]],"date-time":"2011-05-04T05:23:47Z","timestamp":1304486627000},"page":"317-343","source":"Crossref","is-referenced-by-count":56,"title":["Boolean lexicographic optimization: algorithms & applications"],"prefix":"10.1007","volume":"62","author":[{"given":"Joao","family":"Marques-Silva","sequence":"first","affiliation":[]},{"given":"Josep","family":"Argelich","sequence":"additional","affiliation":[]},{"given":"Ana","family":"Gra\u00e7a","sequence":"additional","affiliation":[]},{"given":"In\u00eas","family":"Lynce","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,5,5]]},"reference":[{"issue":"4","key":"9233_CR1","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T Achterberg","year":"2006","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34(4), 361\u2013372 (2006). Benchmarks available from http:\/\/miplib.zib.de","journal-title":"Oper. Res. Lett."},{"key":"9233_CR2","doi-asserted-by":"crossref","unstructured":"Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: Generic ILP versus specialized 0-1 ILP: an update. In: International Conference on Computer-Aided Design, pp. 450\u2013457 (2002)","DOI":"10.1145\/774572.774638"},{"key":"9233_CR3","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: Solving (weighted) partial MaxSAT through satisfiability testing. In: International Conference on Theory and Applications of Satisfiability Testing, pp. 427\u2013440 (2009)","DOI":"10.1007\/978-3-642-02777-2_39"},{"key":"9233_CR4","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: A new algorithm for weighted partial maxsat. In: AAAI Conference on Artificial Intelligence (2010)","DOI":"10.1609\/aaai.v24i1.7545"},{"key":"9233_CR5","unstructured":"Argelich, J., Li, C.M., Many\u00e0, F.: An improved exact solver for partial Max-SAT. In: International Conference on Nonconvex Programming: Local and Global Approaches, pp. 230\u2013231 (2007)"},{"key":"9233_CR6","unstructured":"Argelich, J., Li, C.M., Many\u00e0, F.: An improved exact solver for partial Max-SAT. In: Int. Conf. on Nonconvex Programming: Local & Global Approaches, pp. 230\u2013231 (2007)"},{"key":"9233_CR7","unstructured":"Argelich, J., Li, C.M., Many\u00e0, F., Planes, J.: MaxSAT Evaluations. http:\/\/www.maxsat.udl.cat\/"},{"key":"9233_CR8","unstructured":"Argelich, J., Lynce, I., Marques-Silva, J.: On solving Boolean multilevel optimization problems. In: International Joint Conference on Artificial Intelligence, pp. 393\u2013398 (2009)"},{"key":"9233_CR9","first-page":"191","volume":"2","author":"O Bailleux","year":"2006","unstructured":"Bailleux, O., Boufkhad, Y., Roussel, O.: A translation of pseudo Boolean constraints to SAT. JSAT 2, 191\u2013200 (2006)","journal-title":"JSAT"},{"key":"9233_CR10","unstructured":"Barth, P.: A Davis\u2013Putnam enumeration algorithm for linear pseudo-Boolean optimization. Technical Report MPI-I-95-2-003, Max Plank Institute for Computer Science (1995)"},{"issue":"3","key":"9233_CR11","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/A:1026488509554","volume":"4","author":"E Bensana","year":"1999","unstructured":"Bensana, E., Lema\u00eetre, M., Verfaillie, G.: Earth observation satellite management. Constraints 4(3), 293\u2013299 (1999)","journal-title":"Constraints"},{"key":"9233_CR12","unstructured":"Berre, D.L.: SAT4J Library. http:\/\/www.sat4j.org"},{"key":"9233_CR13","doi-asserted-by":"crossref","unstructured":"Berre, D.L., Rapicault, P.: Dependency management for the Eclipse ecosystem. In: International Workshop on Open Component Ecosystems, pp. 21\u201330 (2009)","DOI":"10.1145\/1595800.1595805"},{"key":"9233_CR14","unstructured":"B\u00fcning, H.K., Kullmann, O.: Minimal unsatisfiability and autarkies. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) SAT Handbook, pp. 735\u2013760. IOS Press (2009)"},{"key":"9233_CR15","doi-asserted-by":"crossref","unstructured":"Chai, D., Kuehlmann, A.: A fast pseudo-Boolean constraint solver. In: Design Automation Conference, pp. 830\u2013835 (2003)","DOI":"10.1145\/775832.776041"},{"issue":"1","key":"9233_CR16","first-page":"121","volume":"8","author":"M Codish","year":"2008","unstructured":"Codish, M., Lagoon, V., Stuckey, P.J.: Logic programming with satisfiability. TPLP 8(1), 121\u2013128 (2008)","journal-title":"TPLP"},{"key":"9233_CR17","doi-asserted-by":"crossref","unstructured":"Cooper, M.C., Cussat-Blanc, S., de Roquemaurel, M., R\u00e9gnier, P.: Soft arc consistency applied to optimal planning. In: International Conference on Principles and Practice of Constraint Programming, pp. 680\u2013684 (2006)","DOI":"10.1007\/11889205_50"},{"key":"9233_CR18","doi-asserted-by":"crossref","unstructured":"Coudert, O.: On solving covering problems. In: Design Automation Conference, pp. 197\u2013202 (1996)","DOI":"10.1145\/240518.240555"},{"issue":"1\u20132","key":"9233_CR19","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/BF02178370","volume":"80","author":"C Simone de","year":"1995","unstructured":"de\u00a0Simone, C., Diehl, M., J\u00fcnger, M., Mutzel, P., Reinelt, G., Rinaldi, G.: Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm. J. Stat. Phys. 80(1\u20132), 487\u2013496 (1995)","journal-title":"J. Stat. Phys."},{"key":"9233_CR20","unstructured":"EDOS European Project: URL: http:\/\/www.edos-project.org\/bin\/view\/Main\/"},{"key":"9233_CR21","first-page":"1","volume":"2","author":"N Een","year":"2006","unstructured":"Een, N., S\u00f6rensson, N.: Translating pseudo-Boolean constraints into SAT. JSAT 2, 1\u201326 (2006)","journal-title":"JSAT"},{"key":"9233_CR22","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer (2005)"},{"issue":"4","key":"9233_CR23","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s002910000046","volume":"22","author":"M Ehrgott","year":"2000","unstructured":"Ehrgott, M., Gandibleux, X.: A survey and annotated bibliography of multiobjective combinatorial optimization. OR-Spektrum 22(4), 425\u2013460 (2000)","journal-title":"OR-Spektrum"},{"issue":"1","key":"9233_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10601-009-9069-0","volume":"15","author":"E Freuder","year":"2010","unstructured":"Freuder, E., Heffernan, R., Wallace, R., Wilson, N.: Lexicographically-ordered constraint satisfaction problems. Constraints 15(1), 1\u201328 (2010)","journal-title":"Constraints"},{"key":"9233_CR25","doi-asserted-by":"crossref","unstructured":"Fu, Z., Malik, S.: On solving the partial MAX-SAT problem. In: International Conference on Theory and Applications of Satisfiability Testing, pp. 252\u2013265 (2006)","DOI":"10.1007\/11814948_25"},{"issue":"3","key":"9233_CR26","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1023\/A:1009682532542","volume":"6","author":"X Gandibleux","year":"2000","unstructured":"Gandibleux, X., Frevilel, A.: Tabu search based procedure for solving the 0\u20131 multiobjective knapsack problem: the two objectives case. Journal of Heuristics 6(3), 361\u2013383 (2000)","journal-title":"Journal of Heuristics"},{"key":"9233_CR27","doi-asserted-by":"crossref","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: clasp: a conflict-driven answer set solver. In: Logic Programming and Nonmonotonic Reasoning, pp. 260\u2013265 (2007)","DOI":"10.1007\/978-3-540-72200-7_23"},{"key":"9233_CR28","unstructured":"Giunchiglia, E., Maratea, M.: Planning as satisfiability with preferences. In: AAAI Conference on Artificial Intelligence, pp. 987\u2013992 (2007)"},{"key":"9233_CR29","doi-asserted-by":"crossref","unstructured":"Gomes, C.P., Kautz, H., Sabharwal, A., Selman, B.: Satisfiability solvers. In: Handbook of Knowledge Representation, pp. 89\u2013134. Elsevier (2008)","DOI":"10.1016\/S1574-6526(07)03002-7"},{"key":"9233_CR30","unstructured":"Gra\u00e7a, A., Lynce, I., Marques-Silva, J., Oliveira, A.L.: Haplotype inference combining pedigrees and unrelated individuals. In: Workshop on Constraint Based Methods for Bioinformatics (2009)"},{"key":"9233_CR31","unstructured":"Gra\u00e7a, A., Lynce, I., Marques-Silva, J., Oliveira, A.L.: Efficient and accurate haplotype inference by combining parsimony and pedigree information. In: Algebraic and Numeric Biology, LNCS, vol. 6479 (2010)"},{"issue":"4","key":"9233_CR32","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02241270","volume":"44","author":"P Hansen","year":"1990","unstructured":"Hansen, P., Jaumard, B.: Algorithms for the maximum satisfiability problem. Computing 44(4), 279\u2013303 (1990)","journal-title":"Computing"},{"issue":"2\u20134","key":"9233_CR33","first-page":"239","volume":"4","author":"F Heras","year":"2006","unstructured":"Heras, F., Larrosa, J., de\u00a0Givry, S., Schiex, T.: 2006 and 2007 Max-SAT evaluations: contributed instances. JSAT 4(2\u20134), 239\u2013250 (2008)","journal-title":"JSAT"},{"key":"9233_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.2347","volume":"31","author":"F Heras","year":"2008","unstructured":"Heras, F., Larrosa, J., Oliveras, A.: MiniMaxSat: an efficient weighted Max-SAT solver. J. Artif. Intell. Res. 31, 1\u201332 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"9233_CR35","doi-asserted-by":"crossref","unstructured":"Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. In: ACM Conference on Electronic Commerce, pp. 66\u201376 (2000)","DOI":"10.1145\/352871.352879"},{"key":"9233_CR36","unstructured":"Li, C.M., Many\u00e0, F.: MaxSAT, hard and soft constraints. In: SAT Handbook, pp. 613\u2013632. IOS Press (2009)"},{"key":"9233_CR37","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1613\/jair.2215","volume":"30","author":"CM Li","year":"2007","unstructured":"Li, C.M., Many\u00e0, F., Planes, J.: New inference rules for Max-SAT. J. Artif. Intell. Res. 30, 321\u2013359 (2007)","journal-title":"J. Artif. Intell. Res."},{"key":"9233_CR38","unstructured":"Lin, H., Su, K.: Exploiting inference rules to compute lower bounds for MAX-SAT solving. In: International Joint Conference on Artificial Intelligence, pp. 2334\u20132339 (2007)"},{"key":"9233_CR39","doi-asserted-by":"crossref","unstructured":"Lukasiewycz, M., Gla\u00df, M., Haubelt, C., Teich, J.: Solving multi-objective pseudo-Boolean problems. In: International Conference on Theory and Applications of Satisfiability Testing, pp. 56\u201369 (2007)","DOI":"10.1007\/978-3-540-72788-0_9"},{"key":"9233_CR40","doi-asserted-by":"crossref","unstructured":"Mancinelli, F., Boender, J., Cosmo, R.D., Vouillon, J., Durak, B., Leroy, X., Treinen, R.: Managing the complexity of large free and open source package-based software distributions. In: Int. Conf. Automated Soft. Engineering, pp. 199\u2013208 (2006)","DOI":"10.1109\/ASE.2006.49"},{"key":"9233_CR41","unstructured":"Mancoosi European Project: URL: http:\/\/www.mancoosi.org\/"},{"key":"9233_CR42","unstructured":"Mancoosi European Project: Internal evaluation. URL: http:\/\/www.mancoosi.org\/misc-live (2010)"},{"key":"9233_CR43","unstructured":"Mancoosi European Project: International evaluation. URL: http:\/\/www.mancoosi.org\/misc-2010 (2010)"},{"issue":"3\u20134","key":"9233_CR44","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1023\/B:AMAI.0000012872.46214.11","volume":"40","author":"V Manquinho","year":"2004","unstructured":"Manquinho, V., Marques-Silva, J.: Satisfiability-based algorithms for Boolean optimization. Ann. Math. Artif. Intell. 40(3\u20134), 353\u2013372 (2004)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9233_CR45","doi-asserted-by":"crossref","unstructured":"Manquinho, V., Marques-Silva, J., Planes, J.: Algorithms for weighted Boolean optimization. In: International Conference on Theory and Applications of Satisfiability Testing, pp. 495\u2013508 (2009)","DOI":"10.1007\/978-3-642-02777-2_45"},{"key":"9233_CR46","unstructured":"Marques-Silva, J.: Practical applications of Boolean-based optimization: a bibliography. Technical Report\u00a058, INESC-ID (2009)"},{"key":"9233_CR47","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) SAT Handbook, pp. 131\u2013154. IOS Press (2009)","DOI":"10.3233\/978-1-58603-929-5-131"},{"key":"9233_CR48","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Manquinho, V.: Towards more effective unsatisfiability-based maximum satisfiability algorithms. In: International Conference on Theory and Applications of Satisfiability Testing, pp. 225\u2013230 (2008)","DOI":"10.1007\/978-3-540-79719-7_21"},{"key":"9233_CR49","unstructured":"Marques-Silva, J., Planes, J.: On using unsatisfiability for solving maximum satisfiability. Computing Research Repository, abs\/0712.0097 (2007)"},{"key":"9233_CR50","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Planes, J.: Algorithms for maximum satisfiability using unsatisfiable cores. In: Design, Automation and Testing in Europe Conference, pp. 408\u2013413 (2008)","DOI":"10.1145\/1403375.1403474"},{"issue":"9","key":"9233_CR51","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1057\/jors.1987.133","volume":"38","author":"NV Phillips","year":"1987","unstructured":"Phillips, N.V.: A weighting function for pre-emptive multicriteria assignment problems. J. Oper. Res. Soc. 38(9), 797\u2013802 (1987)","journal-title":"J. Oper. Res. Soc."},{"key":"9233_CR52","doi-asserted-by":"crossref","first-page":"191","DOI":"10.3233\/SAT190044","volume":"4","author":"K Pipatsrisawat","year":"2008","unstructured":"Pipatsrisawat, K., Palyan, A., Chavira, M., Choi, A., Darwiche, A.: Solving weighted Max-SAT problems in a reduced search space: a performance analysis. Journal on Satisfiability Boolean Modeling and Computation 4, 191\u2013217 (2008)","journal-title":"Journal on Satisfiability Boolean Modeling and Computation"},{"key":"9233_CR53","unstructured":"Prestwich, S.: CNF encodings. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) SAT Handbook, pp. 75\u201398. IOS Press (2009)"},{"key":"9233_CR54","doi-asserted-by":"crossref","unstructured":"Ram\u00edrez, M., Geffner, H.: Structural relaxations by variable renaming and their compilation for solving MinCostSAT. In: International Conference on Principles and Practice of Constraint Programming, pp. 605\u2013619 (2007)","DOI":"10.1007\/978-3-540-74970-7_43"},{"issue":"1","key":"9233_CR55","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0305-0483(00)00026-8","volume":"29","author":"C Romero","year":"2001","unstructured":"Romero, C.: Extended lexicographic goal programming: a unifying approach. Omega 29(1), 63\u201371 (2001)","journal-title":"Omega"},{"issue":"4","key":"9233_CR56","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/s10601-010-9095-y","volume":"15","author":"ED Rosa","year":"2010","unstructured":"Rosa, E.D., Giunchiglia, E., Maratea, M.: Solving satisfiability problems with preferences. Constraints 15(4), 485\u2013515 (2010)","journal-title":"Constraints"},{"key":"9233_CR57","unstructured":"Roussel, O., Manquinho, V.: Pseudo-Boolean and cardinality constraints. In: SAT Handbook, pp. 695\u2013734. IOS Press (2009)"},{"key":"9233_CR58","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley (1998)"},{"issue":"3","key":"9233_CR59","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/opre.1040.0189","volume":"53","author":"D Strickland","year":"2005","unstructured":"Strickland, D., Barnes, E., Sokol, J.: Optimal protein structure alignment using maximum cliques. Oper. Res. 53(3), 389\u2013402 (2005)","journal-title":"Oper. Res."},{"key":"9233_CR60","doi-asserted-by":"crossref","unstructured":"Teghem, J.: Multi-objective combinatorial optimization. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 2437\u20132442. Springer (2009)","DOI":"10.1007\/978-0-387-74759-0_418"},{"key":"9233_CR61","doi-asserted-by":"crossref","unstructured":"Tucker, C., Shuffelton, D., Jhala, R., Lerner, S.: OPIUM: optimal package install\/uninstall manager. In: Int. Conf. Soft. Engineering, pp. 178\u2013188 (2007)","DOI":"10.1109\/ICSE.2007.59"},{"key":"9233_CR62","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/mcda.4020030204","volume":"3","author":"EL Ulungu","year":"1994","unstructured":"Ulungu, E.L., Teghem, J.: Multi-objective combinatorial optimization problems: a survey. J. Multi-Criteria Decis. Anal. 3, 83\u2013104 (1994)","journal-title":"J. Multi-Criteria Decis. Anal."},{"issue":"2","key":"9233_CR63","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0020-0190(98)00144-6","volume":"68","author":"JP Warners","year":"1998","unstructured":"Warners, J.P.: A linear-time transformation of linear inequalities into conjunctive normal form. Inf. Process. Lett. 68(2), 63\u201369 (1998)","journal-title":"Inf. Process. Lett."},{"key":"9233_CR64","unstructured":"Wolsey, L.A., Nemhauser, G.L.: Integer and Combinatorial Optimization. Wiley (1999)"},{"key":"9233_CR65","unstructured":"Yagiura, M.: Ramsey Number Problem Generator. Available from http:\/\/www-or.amp.i.kyoto-u.ac.jp\/~yagiura\/sat\/Ramsey\/ (1998)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-011-9233-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-011-9233-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-011-9233-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T10:51:21Z","timestamp":1741171881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-011-9233-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,5]]},"references-count":65,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["9233"],"URL":"https:\/\/doi.org\/10.1007\/s10472-011-9233-2","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,5]]}}}