| Publication | Date of Publication | Type |
|---|
| Computing efficiently the nondominated subset of a set sum | 2023-10-04 | Paper |
| An approximation algorithm for a general class of parametric optimization problems | 2022-07-18 | Paper |
| The power of the weighted sum scalarization for approximating multiobjective optimization problems | 2022-02-14 | Paper |
| One-exact approximate Pareto sets | 2021-07-07 | Paper |
| Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems | 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 | 2018-09-28 | Paper |
| Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem | 2018-07-11 | Paper |
| Weighted sum model with partial preference information: application to multi-objective optimization | 2018-05-29 | Paper |
| Discrete representation of the non-dominated set for multi-objective optimization problems using kernels | 2018-05-29 | Paper |
| Efficient computation of the search region in multi-objective optimization | 2018-05-29 | Paper |
| Robust capacity expansion of a network under demand uncertainty: A bi‐objective approach | 2018-05-11 | Paper |
| Bi-objective matchings with the triangle inequality | 2017-03-16 | Paper |
| Covers and approximations in multiobjective optimization | 2017-03-03 | Paper |
| An efficient procedure for finding best compromise solutions to the multi-objective assignment problem | 2016-11-17 | Paper |
| A multi-objective interactive system for adaptive traffic control | 2016-10-06 | Paper |
| On the representation of the search region in multi-objective optimization | 2016-10-06 | Paper |
| A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size | 2014-08-18 | Paper |
| Critical edges for the assignment problem: complexity and exact resolution | 2014-05-15 | Paper |
| On the number of non-dominated points of a multicriteria optimization problem | 2014-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2861549 | 2013-11-08 | Paper |
| Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem | 2013-08-26 | Paper |
| Critical edges/nodes for the minimum spanning tree problem: complexity and approximation | 2013-08-09 | Paper |
| Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems | 2013-03-25 | Paper |
| Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria | 2012-12-29 | Paper |
| Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem | 2012-11-15 | Paper |
| General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems | 2012-06-20 | Paper |
| Preference-based English reverse auctions | 2011-11-17 | Paper |
| The lexicographic α-robust knapsack problem | 2011-08-17 | Paper |
| Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem | 2011-08-12 | Paper |
| Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems | 2011-01-08 | Paper |
| Satisfactory graph partition, variants, and generalizations | 2010-06-11 | Paper |
| Lexicographicα-robustness: an application to the 1-median problem | 2010-05-26 | Paper |
| A bi-criteria approach for the data association problem | 2010-03-23 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Implementing an efficient fptas for the 0-1 multi-objective knapsack problem | 2009-06-30 | Paper |
| Min-max and min-max regret versions of combinatorial optimization problems: A survey | 2009-04-30 | Paper |
| Solving efficiently the 0-1 multi-objective knapsack problem | 2008-10-08 | Paper |
| A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem | 2008-09-25 | Paper |
| Energy crop supply in France: a min-max regret approach | 2008-08-12 | Paper |
| Approximation of satisfactory bisection problems | 2008-06-26 | Paper |
| Complexity of the min-max (regret) versions of min cut problems | 2008-05-16 | Paper |
| An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem | 2008-01-02 | Paper |
| Approximating Min-Max (Regret) Versions of Some Polynomial Problems | 2007-09-10 | Paper |
| Efficient algorithms for decomposing graphs under degree constraints | 2007-05-30 | Paper |
| Approximation of min-max and min-max regret versions of some combinatorial optimization problems | 2007-01-09 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| The satisfactory partition problem | 2006-06-30 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Degree-constrained decompositions of graphs: Bounded treewidth and planarity | 2006-04-28 | Paper |
| Complexity of the min-max and min-max regret assignment problems | 2006-02-02 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4669237 | 2005-04-15 | Paper |
| Aggregation of dispersed consequences for constructing criteria: The evaluation of flood risk reduction strategies | 2003-04-10 | Paper |
| Construction of rule-based assignment models | 2002-06-16 | Paper |
| Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite | 2002-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2710083 | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4697929 | 2000-07-09 | Paper |
| An overview on ``The European school of MCDA: Emergence, basic features and current works | 1999-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230928 | 1999-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4387184 | 1998-11-15 | Paper |
| An interactive multiobjective procedure for selecting medium‐term countermeasures after nuclear accidents | 1998-06-11 | Paper |
