Daniel Vanderpooten

Publication Activity (10 Years)

Years Active: 1993-2023
Publications (10 Years): 20

Top Topics

Optimization Problems

Top Venues

Eur. J. Oper. Res.

J. Comb. Optim.

Comput. Oper. Res.

Publications

Satya Tamby, Daniel Vanderpooten
Optimizing over the Efficient Set of a Multi-Objective Discrete Optimization Problem. SEA (2023)
Antoine Kerberenes, Daniel Vanderpooten, Jean Michel Vanpeperstraete
Computing efficiently the nondominated subset of a set sum. Int. Trans. Oper. Res. 30 (6) (2023)
Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
Approximating Multiobjective Optimization Problems: How exact can you be? CoRR (2023)
Andreia P. Guerreiro, João Cortes, Daniel Vanderpooten, Cristina Bazgan, Inês Lynce, Vasco M. Manquinho, José Rui Figueira
Exact and approximate determination of the Pareto front using Minimal Correction Subsets. Comput. Oper. Res. 153 (2023)
Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems. Theory Comput. Syst. 66 (1) (2022)
Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
An approximation algorithm for a general class of parametric optimization problems. J. Comb. Optim. 43 (5) (2022)
Andreia P. Guerreiro, João Cortes, Daniel Vanderpooten, Cristina Bazgan, Inês Lynce, Vasco M. Manquinho, José Rui Figueira
Exact and approximate determination of the Pareto set using minimal correction subsets. CoRR (2022)
Arne Herzel, Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
One-exact approximate Pareto sets. J. Glob. Optim. 80 (1) (2021)
Satya Tamby, Daniel Vanderpooten
Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems. INFORMS J. Comput. 33 (1) (2021)
Arne Herzel, Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
One-Exact Approximate Pareto Sets. CoRR (2019)
Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems. CoRR (2019)
Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
An FPTAS for a General Class of Parametric Optimization Problems. COCOON (2019)
Marek Cornu, Tristan Cazenave, Daniel Vanderpooten
Perturbed Decomposition Algorithm applied to the multi-objective Traveling Salesman Problem. Comput. Oper. Res. 79 (2017)
Laurent Gourvès, Jérôme Monnot, Fanny Pascual, Daniel Vanderpooten
Bi-objective matchings with the triangle inequality. Theor. Comput. Sci. 670 (2017)
Sami Kaddani, Daniel Vanderpooten, Jean Michel Vanpeperstraete, Hassene Aissi
Weighted sum model with partial preference information: Application to multi-objective optimization. Eur. J. Oper. Res. 260 (2) (2017)
Cristina Bazgan, Florian Jamain, Daniel Vanderpooten
Discrete representation of the non-dominated set for multi-objective optimization problems using kernels. Eur. J. Oper. Res. 260 (3) (2017)
Kerstin Dächert, Kathrin Klamroth, Renaud Lacour, Daniel Vanderpooten
Efficient computation of the search region in multi-objective optimization. Eur. J. Oper. Res. 260 (3) (2017)
Daniel Vanderpooten, Lakmali Weerasena, Margaret M. Wiecek
Covers and approximations in multiobjective optimization. J. Glob. Optim. 67 (3) (2017)
Hassene Aissi, Daniel Vanderpooten
Robust capacity expansion of a network under demand uncertainty: A bi-objective approach. Networks 68 (3) (2016)
Sami Kaddani, Satya Tamby, Daniel Vanderpooten, Jean Michel Vanpeperstraete
Partial preference models using translated cones in discrete multi-objective optimization. SSCI (2016)
Kathrin Klamroth, Renaud Lacour, Daniel Vanderpooten
On the representation of the search region in multi-objective optimization. Eur. J. Oper. Res. 245 (3) (2015)
Kathrin Klamroth, Renaud Lacour, Daniel Vanderpooten
On the representation of the search region in multi-objective optimization. CoRR (2015)
Yann Dujardin, Daniel Vanderpooten, Florence Boillot
A multi-objective interactive system for adaptive traffic control. Eur. J. Oper. Res. 244 (2) (2015)
Cristina Bazgan, Florian Jamain, Daniel Vanderpooten
Approximate Pareto sets of minimal size for multi-objective optimization problems. Oper. Res. Lett. 43 (1) (2015)
Lyes Belhoul, Lucie Galand, Daniel Vanderpooten
An efficient procedure for finding best compromise solutions to the multi-objective assignment problem. Comput. Oper. Res. 49 (2014)
Mohamed Ali Aloulou, Afef Bouzaiene, Najoua Dridi, Daniel Vanderpooten
A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size. J. Sched. 17 (1) (2014)
José Rui Figueira, Luís Paquete, Marco Simões, Daniel Vanderpooten
Algorithmic improvements on dynamic programming for the bi-objective {0, 1} knapsack problem. Comput. Optim. Appl. 56 (1) (2013)
Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten
Complexity of determining the most vital elements for the p-median and p-center location problems. J. Comb. Optim. 25 (2) (2013)
Cristina Bazgan, Florian Jamain, Daniel Vanderpooten
On the number of non-dominated points of a multicriteria optimization problem. Discret. Appl. Math. 161 (18) (2013)
Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation. J. Comb. Optim. 26 (1) (2013)
Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten
Critical edges for the assignment problem: Complexity and exact resolution. Oper. Res. Lett. 41 (6) (2013)
Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten
Efficient determination of the k most vital edges for the minimum spanning tree problem. Comput. Oper. Res. 39 (11) (2012)
Rim Kalaï, Claude Lamboray, Daniel Vanderpooten
Lexicographic α-robustness: An alternative to min-max criteria. Eur. J. Oper. Res. 220 (3) (2012)
Rim Kalaï, Daniel Vanderpooten
-robust knapsack problem. Int. Trans. Oper. Res. 18 (1) (2011)
Yann Dujardin, Florence Boillot, Daniel Vanderpooten, Pierre Vinant
Multiobjective and multimodal adaptive traffic light control on single junctions. ITSC (2011)
Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten
Most Vital Edges for the Minimum Spanning Tree Problem. COCOA (2011)
Marie-Jo Bellosta, Sylvie Kornman, Daniel Vanderpooten
Preference-based English reverse auctions. Artif. Intell. 175 (7-8) (2011)
Afef Bouzaiene, Najoua Dridi, Mohamed Ali Aloulou, Daniel Vanderpooten
A bicriteria flow-shop scheduling problem with two serial batching machines. Electron. Notes Discret. Math. 36 (2010)
Rim Kalaï, Mohamed Ali Aloulou, Philippe Vallin, Daniel Vanderpooten
-robustness: an application to the 1-median problem. RAIRO Oper. Res. 44 (2) (2010)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems. Discret. Optim. 7 (3) (2010)
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
Satisfactory graph partition, variants, and generalizations. Eur. J. Oper. Res. 206 (2) (2010)
Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten
Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems. COCOA (1) (2010)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Min-max and min-max regret versions of combinatorial optimization problems: A survey. Eur. J. Oper. Res. 197 (2) (2009)
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten
Solving efficiently the 0-1 multi-objective knapsack problem. Comput. Oper. Res. 36 (1) (2009)
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten
Implementing an efficient fptas for the 0-1 multi-objective knapsack problem. Eur. J. Oper. Res. 198 (1) (2009)
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
Approximation of satisfactory bisection problems. J. Comput. Syst. Sci. 74 (5) (2008)
Marie-Jo Bellosta, Sylvie Kornman, Daniel Vanderpooten
A unified framework for multiple criteria auction mechanisms. Web Intell. Agent Syst. 6 (4) (2008)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Complexity of the min-max (regret) versions of min cut problems. Discret. Optim. 5 (1) (2008)
Mohamed Farah, Daniel Vanderpooten
An outranking approach for information retrieval. Inf. Retr. 11 (4) (2008)
John Buchanan, Daniel Vanderpooten
Ranking projects for an electricity utility using ELECTRE III. Int. Trans. Oper. Res. 14 (4) (2007)
A. O. Kazakçi, Stelios Rozakis, Daniel Vanderpooten
Energy crop supply in France: a min-max regret approach. J. Oper. Res. Soc. 58 (11) (2007)
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
Efficient algorithms for decomposing graphs under degree constraints. Discret. Appl. Math. 155 (8) (2007)
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem. ESA (2007)
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten
An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem. WEA (2007)
Marie-Jo Bellosta, Imène Brigui-Chtioui, Sylvie Kornman, Suzanne Pinson, Daniel Vanderpooten
Système multi-agent pour des enchères multicritères Modèle et expérimentations. Rev. d'Intelligence Artif. 21 (5-6) (2007)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Approximation of min-max and min-max regret versions of some combinatorial optimization problems. Eur. J. Oper. Res. 179 (2) (2007)
Mohamed Farah, Daniel Vanderpooten
L'Agrégation en Recherche d'Information. CORIA (2007)
Mohamed Farah, Daniel Vanderpooten
An outranking approach for rank aggregation in information retrieval. SIGIR (2007)
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
The satisfactory partition problem. Discret. Appl. Math. 154 (8) (2006)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Approximating Min-Max (Regret) Versions of Some Polynomial Problems. COCOON (2006)
Mohamed Farah, Daniel Vanderpooten
A Multiple Criteria Approach for Information Retrieval. SPIRE (2006)
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
Degree-constrained decompositions of graphs: Bounded treewidth and planarity. Theor. Comput. Sci. 355 (3) (2006)
Hadrien Hugot, Daniel Vanderpooten, Jean Michel Vanpeperstraete
A bi-criteria approach for the data association problem. Ann. Oper. Res. 147 (1) (2006)
Marie-Jo Bellosta, Sylvie Kornman, Daniel Vanderpooten
An Agent-Based Mechanism for Autonomous Multiple Criteria Auctions. IAT (2006)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack. ESA (2005)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Complexity of the Min-Max (Regret) Versions of Cut Problems. ISAAC (2005)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Complexity of the min-max and min-max regret assignment problems. Oper. Res. Lett. 33 (6) (2005)
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
Complexity and Approximation of Satisfactory Partition Problems. COCOON (2005)
Marie-Jo Bellosta, Sylvie Kornman, Daniel Vanderpooten
A framework for multiple criteria English reverse auctions. IAT (2005)
Marie-Jo Bellosta, Imène Brigui, Sylvie Kornman, Daniel Vanderpooten
A multi-criteria model for electronic auctions. SAC (2004)
Mohamed Farah, Daniel Vanderpooten
Novel Approaches in Text Information Retrieval - Experiments in the Web Track of TREC 2004. TREC (2004)
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
On the Existence and Determination of Satisfactory Partitions in a Graph. ISAAC (2003)
R. Azibi, Daniel Vanderpooten
Aggregation of dispersed consequences for constructing criteria: The evaluation of flood risk reduction strategies. Eur. J. Oper. Res. 144 (2) (2003)
Virginie Gabrel, Daniel Vanderpooten
Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite. Eur. J. Oper. Res. 139 (3) (2002)
R. Azibi, Daniel Vanderpooten
Construction of rule-based assignment models. Eur. J. Oper. Res. 138 (2) (2002)
Jerzy Stefanowski, Daniel Vanderpooten
Induction of decision rules in classification and discovery-oriented perspectives. Int. J. Intell. Syst. 16 (1) (2001)
Roman Slowinski, Daniel Vanderpooten
A Generalized Definition of Rough Approximations Based on Similarity. IEEE Trans. Knowl. Data Eng. 12 (2) (2000)
Jerzy Stefanowski, Daniel Vanderpooten
A General Two-Stage Approach to Inducing Rules from Examples. RSKD (1993)