| Publication | Date of Publication | Type |
|---|
A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem
Networks | 2025-01-15 | Paper |
Approximating multiobjective optimization problems: how exact can you be?
Mathematical Methods of Operations Research | 2024-10-09 | Paper |
Computing efficiently the nondominated subset of a set sum
International Transactions in Operational Research | 2023-10-04 | Paper |
An approximation algorithm for a general class of parametric optimization problems
Journal of Combinatorial Optimization | 2022-07-18 | Paper |
The power of the weighted sum scalarization for approximating multiobjective optimization problems
Theory of Computing Systems | 2022-02-14 | Paper |
One-exact approximate Pareto sets
Journal of Global Optimization | 2021-07-07 | Paper |
Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
INFORMS Journal on Computing | 2021-06-23 | Paper |
An FPTAS for a general class of parametric optimization problems
| 2020-02-24 | Paper |
Approximate Pareto sets of minimal size for multi-objective optimization problems
Operations Research Letters | 2018-09-28 | Paper |
Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
Computers & Operations Research | 2018-07-11 | Paper |
Efficient computation of the search region in multi-objective optimization
European Journal of Operational Research | 2018-05-29 | Paper |
Weighted sum model with partial preference information: application to multi-objective optimization
European Journal of Operational Research | 2018-05-29 | Paper |
Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
European Journal of Operational Research | 2018-05-29 | Paper |
Robust capacity expansion of a network under demand uncertainty: a bi-objective approach
Networks | 2018-05-11 | Paper |
Bi-objective matchings with the triangle inequality
Theoretical Computer Science | 2017-03-16 | Paper |
Covers and approximations in multiobjective optimization
Journal of Global Optimization | 2017-03-03 | Paper |
An efficient procedure for finding best compromise solutions to the multi-objective assignment problem
Computers & Operations Research | 2016-11-17 | Paper |
A multi-objective interactive system for adaptive traffic control
European Journal of Operational Research | 2016-10-06 | Paper |
On the representation of the search region in multi-objective optimization
European Journal of Operational Research | 2016-10-06 | Paper |
A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size
Journal of Scheduling | 2014-08-18 | Paper |
Critical edges for the assignment problem: complexity and exact resolution
Operations Research Letters | 2014-05-15 | Paper |
On the number of non-dominated points of a multicriteria optimization problem
Discrete Applied Mathematics | 2014-04-23 | Paper |
A bicriteria flow-shop scheduling problem with two serial batching machines
| 2013-11-08 | Paper |
Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
Computational Optimization and Applications | 2013-08-26 | Paper |
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
Journal of Combinatorial Optimization | 2013-08-09 | Paper |
Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems
Journal of Combinatorial Optimization | 2013-03-25 | Paper |
Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria
European Journal of Operational Research | 2012-12-29 | Paper |
Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem
Computers & Operations Research | 2012-11-15 | Paper |
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
Discrete Optimization | 2012-06-20 | Paper |
Preference-based English reverse auctions
Artificial Intelligence | 2011-11-17 | Paper |
The lexicographic \(\alpha \)-robust knapsack problem
International Transactions in Operational Research | 2011-08-17 | Paper |
Efficient algorithms for finding the \(k\) most vital edges for the minimum spanning tree problem
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
Satisfactory graph partition, variants, and generalizations
European Journal of Operational Research | 2010-06-11 | Paper |
Lexicographic \(\alpha\)-robustness: an application to the 1-median problem
RAIRO - Operations Research | 2010-05-26 | Paper |
A bi-criteria approach for the data association problem
Annals of Operations Research | 2010-03-23 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
European Journal of Operational Research | 2009-06-30 | Paper |
Min-max and min-max regret versions of combinatorial optimization problems: A survey
European Journal of Operational Research | 2009-04-30 | Paper |
Solving efficiently the 0-1 multi-objective knapsack problem
Computers & Operations Research | 2008-10-08 | Paper |
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Energy crop supply in France: a min-max regret approach
The Journal of the Operational Research Society | 2008-08-12 | Paper |
Approximation of satisfactory bisection problems
Journal of Computer and System Sciences | 2008-06-26 | Paper |
Complexity of the min-max (regret) versions of min cut problems
Discrete Optimization | 2008-05-16 | Paper |
An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem
Experimental Algorithms | 2008-01-02 | Paper |
Approximating Min-Max (Regret) Versions of Some Polynomial Problems
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Efficient algorithms for decomposing graphs under degree constraints
Discrete Applied Mathematics | 2007-05-30 | Paper |
Approximation of min-max and min-max regret versions of some combinatorial optimization problems
European Journal of Operational Research | 2007-01-09 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
The satisfactory partition problem
Discrete Applied Mathematics | 2006-06-30 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Degree-constrained decompositions of graphs: Bounded treewidth and planarity
Theoretical Computer Science | 2006-04-28 | Paper |
Complexity of the min-max and min-max regret assignment problems
Operations Research Letters | 2006-02-02 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
scientific article; zbMATH DE number 2156672 (Why is no real title available?)
| 2005-04-15 | Paper |
Aggregation of dispersed consequences for constructing criteria: The evaluation of flood risk reduction strategies
European Journal of Operational Research | 2003-04-10 | Paper |
Construction of rule-based assignment models
European Journal of Operational Research | 2002-06-16 | Paper |
Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
European Journal of Operational Research | 2002-05-28 | Paper |
Induction of decision rules in classification and discovery-oriented perspectives
International Journal of Intelligent Systems | 2001-04-17 | Paper |
scientific article; zbMATH DE number 754446 (Why is no real title available?)
| 2000-07-09 | Paper |
An overview on ``The European school of MCDA: Emergence, basic features and current works
European Journal of Operational Research | 1999-04-22 | Paper |
scientific article; zbMATH DE number 1251237 (Why is no real title available?)
| 1999-02-17 | Paper |
scientific article; zbMATH DE number 1149802 (Why is no real title available?)
| 1998-11-15 | Paper |
An interactive multiobjective procedure for selecting medium‐term countermeasures after nuclear accidents
| 1998-06-11 | Paper |
