| The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems | 0 | 0.34 | 2022 |
| Enumeration Of The Nondominated Set Of Multiobjective Discrete Optimization Problems | 1 | 0.36 | 2021 |
| One-Exact Approximate Pareto Sets | 0 | 0.34 | 2021 |
| An FPTAS for a General Class of Parametric Optimization Problems. | 0 | 0.34 | 2019 |
| Discrete representation of the non-dominated set for multi-objective optimization problems using kernels. | 1 | 0.35 | 2017 |
| Efficient computation of the search region in multi-objective optimization. | 6 | 0.47 | 2017 |
| Weighted sum model with partial preference information: Application to multi-objective optimization. | 7 | 0.54 | 2017 |
| Perturbed Decomposition Algorithm applied to the multi-objective Traveling Salesman Problem. | 7 | 0.48 | 2017 |
| Covers and approximations in multiobjective optimization. | 5 | 0.43 | 2017 |
| Bi-objective matchings with the triangle inequality. | 0 | 0.34 | 2017 |
| Robust capacity expansion of a network under demand uncertainty: A bi-objective approach. | 0 | 0.34 | 2016 |
| Approximate Pareto sets of minimal size for multi-objective optimization problems | 7 | 0.48 | 2015 |
| A multi-objective interactive system for adaptive traffic control. | 5 | 0.55 | 2015 |
| An efficient procedure for finding best compromise solutions to the multi-objective assignment problem. | 0 | 0.34 | 2014 |
| Critical edges for the assignment problem: Complexity and exact resolution. | 1 | 0.35 | 2013 |
| Complexity of determining the most vital elements for the p-median and p-center location problems | 7 | 0.49 | 2013 |
| On the number of non-dominated points of a multicriteria optimization problem | 0 | 0.34 | 2013 |
| Critical edges/nodes for the minimum spanning tree problem: complexity and approximation | 8 | 0.48 | 2013 |
| Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem | 11 | 0.55 | 2013 |
| Efficient determination of the k most vital edges for the minimum spanning tree problem | 6 | 0.44 | 2012 |
| Lexicographic α-robustness: An alternative to min-max criteria. | 17 | 0.62 | 2012 |
| The Lexicographic Alpha-Robust Knapsack Problem | 2 | 0.38 | 2011 |
| Preference-based English reverse auctions | 8 | 0.44 | 2011 |
| Efficient algorithms for finding the k most vital edges for the minimum spanning tree problem | 1 | 0.37 | 2011 |
| General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems | 13 | 0.80 | 2010 |
| Satisfactory graph partition, variants, and generalizations | 11 | 0.69 | 2010 |
| A bicriteria flow-shop scheduling problem with two serial batching machines | 0 | 0.34 | 2010 |
| Complexity of determining the most vital elements for the 1-median and 1-center location problems | 5 | 0.46 | 2010 |
| Lexicographic α-robustness: an application to the 1-median problem. | 3 | 0.48 | 2010 |
| Implementing an efficient fptas for the 0-1 multi-objective knapsack problem | 17 | 0.72 | 2009 |
| Solving efficiently the 0-1 multi-objective knapsack problem | 24 | 1.27 | 2009 |
| Min-max and min-max regret versions of combinatorial optimization problems: A survey | 148 | 4.96 | 2009 |
| A unified framework for multiple criteria auction mechanisms | 13 | 0.64 | 2008 |
| Approximation of satisfactory bisection problems | 3 | 0.42 | 2008 |
| Complexity of the min-max (regret) versions of min cut problems | 4 | 0.49 | 2008 |
| An outranking approach for information retrieval | 6 | 0.46 | 2008 |
| Ranking projects for an electricity utility using ELECTRE III | 7 | 0.52 | 2007 |
| An efficient implementation for the 0-1 multi-objective Knapsack problem | 4 | 0.50 | 2007 |
| A practical efficient fptas for the 0-1 multi-objective knapsack problem | 2 | 0.42 | 2007 |
| Système multi-agent pour des enchères multicritères Modèle et expérimentations | 0 | 0.34 | 2007 |
| Efficient algorithms for decomposing graphs under degree constraints | 7 | 0.52 | 2007 |
| L'Agrégation en Recherche d'Information | 0 | 0.34 | 2007 |
| An outranking approach for rank aggregation in information retrieval | 60 | 1.94 | 2007 |
| Approximation of min-max and min-max regret versions of some combinatorial optimization problems | 32 | 1.44 | 2007 |
| Approximating min-max (regret) versions of some polynomial problems | 16 | 1.20 | 2006 |
| A multiple criteria approach for information retrieval | 4 | 0.47 | 2006 |
| The satisfactory partition problem | 11 | 0.72 | 2006 |
| Degree-constrained decompositions of graphs: bounded treewidth and planarity | 6 | 0.51 | 2006 |
| A bi-criteria approach for the data association problem | 0 | 0.34 | 2006 |
| An Agent-Based Mechanism for Autonomous Multiple Criteria Auctions | 6 | 0.54 | 2006 |
