Daniel Vanderpooten

According to our database1, Daniel Vanderpooten authored at least 68 papers between 1993 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


On csauthors.net:


One-Exact Approximate Pareto Sets.
CoRR, 2019

The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems.
CoRR, 2019

An FPTAS for a General Class of Parametric Optimization Problems.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

Bi-objective matchings with the triangle inequality.
Theor. Comput. Sci., 2017

Covers and approximations in multiobjective optimization.
J. Glob. Optim., 2017

Weighted sum model with partial preference information: Application to multi-objective optimization.
Eur. J. Oper. Res., 2017

Efficient computation of the search region in multi-objective optimization.
Eur. J. Oper. Res., 2017

Discrete representation of the non-dominated set for multi-objective optimization problems using kernels.
Eur. J. Oper. Res., 2017

Perturbed Decomposition Algorithm applied to the multi-objective Traveling Salesman Problem.
Comput. Oper. Res., 2017

Robust capacity expansion of a network under demand uncertainty: A bi-objective approach.
Networks, 2016

Partial preference models using translated cones in discrete multi-objective optimization.
Proceedings of the 2016 IEEE Symposium Series on Computational Intelligence, 2016

Approximate Pareto sets of minimal size for multi-objective optimization problems.
Oper. Res. Lett., 2015

On the representation of the search region in multi-objective optimization.
Eur. J. Oper. Res., 2015

A multi-objective interactive system for adaptive traffic control.
Eur. J. Oper. Res., 2015

A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size.
J. Sched., 2014

An efficient procedure for finding best compromise solutions to the multi-objective assignment problem.
Comput. Oper. Res., 2014

Critical edges for the assignment problem: Complexity and exact resolution.
Oper. Res. Lett., 2013

Critical edges/nodes for the minimum spanning tree problem: complexity and approximation.
J. Comb. Optim., 2013

Complexity of determining the most vital elements for the p-median and p-center location problems.
J. Comb. Optim., 2013

On the number of non-dominated points of a multicriteria optimization problem.
Discret. Appl. Math., 2013

Algorithmic improvements on dynamic programming for the bi-objective {0, 1} knapsack problem.
Comput. Optim. Appl., 2013

Lexicographic α-robustness: An alternative to min-max criteria.
Eur. J. Oper. Res., 2012

Efficient determination of the k most vital edges for the minimum spanning tree problem.
Comput. Oper. Res., 2012

The lexicographic <i>α</i>-robust knapsack problem.
Int. Trans. Oper. Res., 2011

Preference-based English reverse auctions.
Artif. Intell., 2011

Multiobjective and multimodal adaptive traffic light control on single junctions.
Proceedings of the 14th International IEEE Conference on Intelligent Transportation Systems, 2011

Efficient Algorithms for Finding the <i>k</i> Most Vital Edges for the Minimum Spanning Tree Problem.
Proceedings of the Combinatorial Optimization and Applications, 2011

Lexicographic <i>α</i>-robustness: an application to the 1-median problem.
RAIRO Oper. Res., 2010

Satisfactory graph partition, variants, and generalizations.
Eur. J. Oper. Res., 2010

A bicriteria flow-shop scheduling problem with two serial batching machines.
Electron. Notes Discret. Math., 2010

General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems.
Discret. Optim., 2010

Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems.
Proceedings of the Combinatorial Optimization and Applications, 2010

Implementing an efficient fptas for the 0-1 multi-objective knapsack problem.
Eur. J. Oper. Res., 2009

Min-max and min-max regret versions of combinatorial optimization problems: A survey.
Eur. J. Oper. Res., 2009

Solving efficiently the 0-1 multi-objective knapsack problem.
Comput. Oper. Res., 2009

A unified framework for multiple criteria auction mechanisms.
Web Intell. Agent Syst., 2008

Approximation of satisfactory bisection problems.
J. Comput. Syst. Sci., 2008

An outranking approach for information retrieval.
Inf. Retr., 2008

Complexity of the min-max (regret) versions of min cut problems.
Discret. Optim., 2008

Système multi-agent pour des enchères multicritères Modèle et expérimentations.
Rev. d'Intelligence Artif., 2007

Energy crop supply in France: a min-max regret approach.
J. Oper. Res. Soc., 2007

Ranking projects for an electricity utility using ELECTRE III.
Int. Trans. Oper. Res., 2007

Approximation of min-max and min-max regret versions of some combinatorial optimization problems.
Eur. J. Oper. Res., 2007

Efficient algorithms for decomposing graphs under degree constraints.
Discret. Appl. Math., 2007

An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

An outranking approach for rank aggregation in information retrieval.
Proceedings of the SIGIR 2007: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2007

A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem.
Proceedings of the Algorithms, 2007

L'Agrégation en Recherche d'Information.
Proceedings of the COnférence en Recherche d'Infomations et Applications, 2007

Degree-constrained decompositions of graphs: Bounded treewidth and planarity.
Theor. Comput. Sci., 2006

The satisfactory partition problem.
Discret. Appl. Math., 2006

A bi-criteria approach for the data association problem.
Ann. Oper. Res., 2006

A Multiple Criteria Approach for Information Retrieval.
Proceedings of the String Processing and Information Retrieval, 2006

An Agent-Based Mechanism for Autonomous Multiple Criteria Auctions.
Proceedings of the 2006 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2006

Approximating Min-Max (Regret) Versions of Some Polynomial Problems.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

Complexity of the min-max and min-max regret assignment problems.
Oper. Res. Lett., 2005

Complexity of the Min-Max (Regret) Versions of Cut Problems.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

A framework for multiple criteria English reverse auctions.
Proceedings of the 2005 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2005

Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack.
Proceedings of the Algorithms, 2005

Complexity and Approximation of Satisfactory Partition Problems.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Novel Approaches in Text Information Retrieval - Experiments in the Web Track of TREC 2004.
Proceedings of the Thirteenth Text REtrieval Conference, 2004

A multi-criteria model for electronic auctions.
Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004

Aggregation of dispersed consequences for constructing criteria: The evaluation of flood risk reduction strategies.
Eur. J. Oper. Res., 2003

On the Existence and Determination of Satisfactory Partitions in a Graph.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite.
Eur. J. Oper. Res., 2002

Construction of rule-based assignment models.
Eur. J. Oper. Res., 2002

Induction of decision rules in classification and discovery-oriented perspectives.
Int. J. Intell. Syst., 2001

A Generalized Definition of Rough Approximations Based on Similarity.
IEEE Trans. Knowl. Data Eng., 2000

A General Two-Stage Approach to Inducing Rules from Examples.
Proceedings of the Rough Sets, 1993