Daniel Vanderpooten
Orcid: 0000-0002-5934-0603
According to our database1,
Daniel Vanderpooten
authored at least 75 papers
between 1993 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Int. Trans. Oper. Res., November, 2023
Exact and approximate determination of the Pareto front using Minimal Correction Subsets.
Comput. Oper. Res., May, 2023
Optimizing over the Efficient Set of a Multi-Objective Discrete Optimization Problem.
Proceedings of the 21st International Symposium on Experimental Algorithms, 2023
2022
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems.
Theory Comput. Syst., 2022
J. Comb. Optim., 2022
Exact and approximate determination of the Pareto set using minimal correction subsets.
CoRR, 2022
2021
Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems.
INFORMS J. Comput., 2021
2019
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019
2017
Weighted sum model with partial preference information: Application to multi-objective optimization.
Eur. J. Oper. Res., 2017
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
2016
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
2015
Oper. Res. Lett., 2015
Eur. J. Oper. Res., 2015
Eur. J. Oper. Res., 2015
2014
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
2013
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
Discret. Appl. Math., 2013
Algorithmic improvements on dynamic programming for the bi-objective {0, 1} knapsack problem.
Comput. Optim. Appl., 2013
2012
Eur. J. Oper. Res., 2012
Efficient determination of the k most vital edges for the minimum spanning tree problem.
Comput. Oper. Res., 2012
2011
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
2010
RAIRO Oper. Res., 2010
Eur. J. Oper. Res., 2010
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
2009
Eur. J. Oper. Res., 2009
Min-max and min-max regret versions of combinatorial optimization problems: A survey.
Eur. J. Oper. Res., 2009
Comput. Oper. Res., 2009
2008
Web Intell. Agent Syst., 2008
Discret. Optim., 2008
2007
Rev. d'Intelligence Artif., 2007
Int. Trans. Oper. Res., 2007
Approximation of min-max and min-max regret versions of some combinatorial optimization problems.
Eur. J. Oper. Res., 2007
Discret. Appl. Math., 2007
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007
Proceedings of the SIGIR 2007: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2007
Proceedings of the Algorithms, 2007
Proceedings of the COnférence en Recherche d'Infomations et Applications, 2007
2006
Theor. Comput. Sci., 2006
Proceedings of the String Processing and Information Retrieval, 2006
Proceedings of the 2006 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2006
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006
2005
Oper. Res. Lett., 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
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
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005
2004
Novel Approaches in Text Information Retrieval - Experiments in the Web Track of TREC 2004.
Proceedings of the Thirteenth Text REtrieval Conference, 2004
Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004
2003
Aggregation of dispersed consequences for constructing criteria: The evaluation of flood risk reduction strategies.
Eur. J. Oper. Res., 2003
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003
2002
Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite.
Eur. J. Oper. Res., 2002
2001
Int. J. Intell. Syst., 2001
2000
IEEE Trans. Knowl. Data Eng., 2000
1993
A General Two-Stage Approach to Inducing Rules from Examples.
Proceedings of the Rough Sets, 1993