J. Argelich, D. L. Berre, I. Lynce, P. M. João, P. Silva et al., Solving Linux Upgradeability Problems Using Boolean Optimization, Lynce and Treinen [9], pp.11-22
DOI : 10.4204/EPTCS.29.2
URL : https://hal.archives-ouvertes.fr/hal-00870877

E. Daniel-le-berre, P. Lonca, A. Marquis, and . Parrain, Optimisation multicritère pour la gestion de dépendances logicielles : utilisation de la norme de tchebycheff, 2012.

M. Codish, S. Genaim, and P. J. Stuckey, A declarative encoding of telecommunications feature subscription in SAT, Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming, PPDP '09, pp.255-266, 2009.
DOI : 10.1145/1599410.1599442

R. , D. Cosmo, and S. Cousin, Project presentation, Mancoosi (Managing the Complexity of the Open Source Infrastructure), 2008.

M. Gebser, R. Kaminski, and T. Schaub, aspcud: A Linux Package Configuration Tool Based on Answer Set Programming, Electronic Proceedings in Theoretical Computer Science, vol.65, pp.12-25, 2011.
DOI : 10.4204/EPTCS.65.2

G. Guttierez, M. Janota, I. Lynce, O. Lhomme, V. Manquinho et al., Final version of the optimizations algorithms and tools, Mancoosi (Managing the Complexity of the Open Source Infrastructure), 2011.

D. , L. Berre, and A. Parrain, The sat4j library, release 2.2 system description, Journal on Satisfiability Boolean Modeling and Computation, vol.7, pp.59-64, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00868136

D. , L. Berre, and P. Rapicault, Dependency management for the eclipse ecosystem : eclipse p2, metadata and resolution, Proceedings of the 1st international workshop on Open component ecosystems, pp.21-30, 2009.

F. Mancinelli, J. Boender, R. Di-cosmo, J. Vouillon, B. Durak et al., Managing the complexity of large free and open source packagebased software distributions, ASE, pp.199-208, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00149566

F. Mancinelli, J. Boender, R. Di-cosmo, and J. Vouillon, Managing the Complexity of Large Free and Open Source Package-Based Software Distributions, 21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06), pp.199-208, 2006.
DOI : 10.1109/ASE.2006.49
URL : https://hal.archives-ouvertes.fr/hal-00149566

M. Vasco, . Manquinho, P. M. João, J. Silva, and . Planes, Algorithms for weighted boolean optimization, Lecture Notes in Computer Science, vol.5584, pp.495-508, 2009.

C. Michel and M. Rueher, Handling software upgradeability problems with MILP solvers, Lynce and Treinen [9], pp.1-10
DOI : 10.4204/EPTCS.29.1
URL : http://doi.org/10.4204/eptcs.29.1

W. Ogryczak, P. Perny, and P. Weng, On Minimizing Ordered Weighted Regrets in Multiobjective Markov Decision Processes, ADT, pp.190-204, 2011.
DOI : 10.1007/978-3-642-24873-3_15
URL : https://hal.archives-ouvertes.fr/hal-01285802

O. Roussel and V. Manquinho, Pseudoboolean and cardinality constraints, Handbook of Satisfiability, pp.695-733, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00870005

P. M. João and . Silva, Minimal unsatisfiability : Models , algorithms and applications (invited paper), In ISMVL, pp.9-14, 2010.

R. E. Steuer and E. U. Choo, An interactive weighted Tchebycheff procedure for multiple objective programming, Mathematical Programming, vol.19, issue.3, pp.326-344, 1983.
DOI : 10.1007/BF02591870

T. Syrjänen, A rule-based formal model for software configuration, Research Report, vol.55, 1999.

A. P. Wierzbicki, On the completeness and constructiveness of parametric characterizations to vector optimization problems, Operations-Research-Spektrum, vol.22, issue.2, pp.73-87, 1986.
DOI : 10.1287/mnsc.22.6.652