A General Two-Stage Approach to Inducing Rules from Examples. - Jerzy Stefanowski; Daniel Vanderpooten (RSKD, 1993)

A Generalized Definition of Rough Approximations Based on Similarity. - Roman Slowinski; Daniel Vanderpooten (IEEE Trans. Knowl. Data Eng., 2000)

Induction of decision rules in classification and discovery-oriented perspectives. - Jerzy Stefanowski; Daniel Vanderpooten (Int. J. Intell. Syst., 2001)

Construction of rule-based assignment models. - R. Azibi; Daniel Vanderpooten (Eur. J. Oper. Res., 2002)

Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite. - Virginie Gabrel; Daniel Vanderpooten (Eur. J. Oper. Res., 2002)

On the Existence and Determination of Satisfactory Partitions in a Graph. - Cristina Bazgan; Zsolt Tuza; Daniel Vanderpooten (ISAAC, 2003)

Aggregation of dispersed consequences for constructing criteria: The evaluation of flood risk reduction strategies. - R. Azibi; Daniel Vanderpooten (Eur. J. Oper. Res., 2003)

A multi-criteria model for electronic auctions. - Marie-Jo Bellosta; Imène Brigui; Sylvie Kornman; Daniel Vanderpooten (SAC, 2004)

Novel Approaches in Text Information Retrieval - Experiments in the Web Track of TREC 2004. - Mohamed Farah 001; Daniel Vanderpooten (TREC, 2004)

Complexity and Approximation of Satisfactory Partition Problems. - Cristina Bazgan; Zsolt Tuza; Daniel Vanderpooten (COCOON, 2005)

Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack. - Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten (ESA, 2005)

A framework for multiple criteria English reverse auctions. - Marie-Jo Bellosta; Sylvie Kornman; Daniel Vanderpooten (IAT, 2005)

Complexity of the Min-Max (Regret) Versions of Cut Problems. - Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten (ISAAC, 2005)

Complexity of the min-max and min-max regret assignment problems. - Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten (Oper. Res. Lett., 2005)

Approximating Min-Max (Regret) Versions of Some Polynomial Problems. - Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten (COCOON, 2006)

An Agent-Based Mechanism for Autonomous Multiple Criteria Auctions. - Marie-Jo Bellosta; Sylvie Kornman; Daniel Vanderpooten (IAT, 2006)

A Multiple Criteria Approach for Information Retrieval. - Mohamed Farah 001; Daniel Vanderpooten (SPIRE, 2006)

A bi-criteria approach for the data association problem. - Hadrien Hugot; Daniel Vanderpooten; Jean Michel Vanpeperstraete (Ann. Oper. Res., 2006)

The satisfactory partition problem. - Cristina Bazgan; Zsolt Tuza; Daniel Vanderpooten (Discret. Appl. Math., 2006)

Degree-constrained decompositions of graphs: Bounded treewidth and planarity. - Cristina Bazgan; Zsolt Tuza; Daniel Vanderpooten (Theor. Comput. Sci., 2006)

L'Agrégation en Recherche d'Information. - Mohamed Farah 001; Daniel Vanderpooten (CORIA, 2007)

A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem. - Cristina Bazgan; Hadrien Hugot; Daniel Vanderpooten (ESA, 2007)

An outranking approach for rank aggregation in information retrieval. - Mohamed Farah 001; Daniel Vanderpooten (SIGIR, 2007)

An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem. - Cristina Bazgan; Hadrien Hugot; Daniel Vanderpooten (WEA, 2007)

Efficient algorithms for decomposing graphs under degree constraints. - Cristina Bazgan; Zsolt Tuza; Daniel Vanderpooten (Discret. Appl. Math., 2007)

Approximation of min-max and min-max regret versions of some combinatorial optimization problems. - Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten (Eur. J. Oper. Res., 2007)

Ranking projects for an electricity utility using ELECTRE III. - John Buchanan; Daniel Vanderpooten (Int. Trans. Oper. Res., 2007)

Energy crop supply in France: a min-max regret approach. - A. O. Kazakçi; Stelios Rozakis; Daniel Vanderpooten (J. Oper. Res. Soc., 2007)

Système multi-agent pour des enchères multicritères Modèle et expérimentations. - Marie-Jo Bellosta; Imène Brigui-Chtioui; Sylvie Kornman; Suzanne Pinson; Daniel Vanderpooten (Rev. d'Intelligence Artif., 2007)

Complexity of the min-max (regret) versions of min cut problems. - Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten (Discret. Optim., 2008)

An outranking approach for information retrieval. - Mohamed Farah 001; Daniel Vanderpooten (Inf. Retr., 2008)

Approximation of satisfactory bisection problems. - Cristina Bazgan; Zsolt Tuza; Daniel Vanderpooten (J. Comput. Syst. Sci., 2008)

A unified framework for multiple criteria auction mechanisms. - Marie-Jo Bellosta; Sylvie Kornman; Daniel Vanderpooten (Web Intell. Agent Syst., 2008)

Solving efficiently the 0-1 multi-objective knapsack problem. - Cristina Bazgan; Hadrien Hugot; Daniel Vanderpooten (Comput. Oper. Res., 2009)

Min-max and min-max regret versions of combinatorial optimization problems: A survey. - Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten (Eur. J. Oper. Res., 2009)

Implementing an efficient fptas for the 0-1 multi-objective knapsack problem. - Cristina Bazgan; Hadrien Hugot; Daniel Vanderpooten (Eur. J. Oper. Res., 2009)

Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems. - Cristina Bazgan; Sonia Toubaline; Daniel Vanderpooten (COCOA (1), 2010)

General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems. - Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten (Discret. Optim., 2010)

A bicriteria flow-shop scheduling problem with two serial batching machines. - Afef Bouzaiene; Najoua Dridi; Mohamed Ali Aloulou; Daniel Vanderpooten (Electron. Notes Discret. Math., 2010)

Satisfactory graph partition, variants, and generalizations. - Cristina Bazgan; Zsolt Tuza; Daniel Vanderpooten (Eur. J. Oper. Res., 2010)

Lexicographic α-robustness: an application to the 1-median problem. - Rim Kalaï; Mohamed Ali Aloulou; Philippe Vallin; Daniel Vanderpooten (RAIRO Oper. Res., 2010)

Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem. - Cristina Bazgan; Sonia Toubaline; Daniel Vanderpooten (COCOA, 2011)

Multiobjective and multimodal adaptive traffic light control on single junctions. - Yann Dujardin; Florence Boillot; Daniel Vanderpooten; Pierre Vinant (ITSC, 2011)

Preference-based English reverse auctions. - Marie-Jo Bellosta; Sylvie Kornman; Daniel Vanderpooten (Artif. Intell., 2011)

The lexicographic α-robust knapsack problem. - Rim Kalaï; Daniel Vanderpooten (Int. Trans. Oper. Res., 2011)

Efficient determination of the k most vital edges for the minimum spanning tree problem. - Cristina Bazgan; Sonia Toubaline; Daniel Vanderpooten (Comput. Oper. Res., 2012)

Lexicographic α-robustness: An alternative to min-max criteria. - Rim Kalaï; Claude Lamboray; Daniel Vanderpooten (Eur. J. Oper. Res., 2012)

Algorithmic improvements on dynamic programming for the bi-objective {0, 1} knapsack problem. - José Rui Figueira; Luís Paquete; Marco Simões; Daniel Vanderpooten (Comput. Optim. Appl., 2013)

On the number of non-dominated points of a multicriteria optimization problem. - Cristina Bazgan; Florian Jamain; Daniel Vanderpooten (Discret. Appl. Math., 2013)

Complexity of determining the most vital elements for the p-median and p-center location problems. - Cristina Bazgan; Sonia Toubaline; Daniel Vanderpooten (J. Comb. Optim., 2013)

Critical edges/nodes for the minimum spanning tree problem: complexity and approximation. - Cristina Bazgan; Sonia Toubaline; Daniel Vanderpooten (J. Comb. Optim., 2013)

Critical edges for the assignment problem: Complexity and exact resolution. - Cristina Bazgan; Sonia Toubaline; Daniel Vanderpooten (Oper. Res. Lett., 2013)

An efficient procedure for finding best compromise solutions to the multi-objective assignment problem. - Lyes Belhoul; Lucie Galand; Daniel Vanderpooten (Comput. Oper. Res., 2014)

A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size. - Mohamed Ali Aloulou; Afef Bouzaiene; Najoua Dridi; Daniel Vanderpooten (J. Sched., 2014)

A multi-objective interactive system for adaptive traffic control. - Yann Dujardin; Daniel Vanderpooten; Florence Boillot (Eur. J. Oper. Res., 2015)

On the representation of the search region in multi-objective optimization. - Kathrin Klamroth; Renaud Lacour; Daniel Vanderpooten (Eur. J. Oper. Res., 2015)

Approximate Pareto sets of minimal size for multi-objective optimization problems. - Cristina Bazgan; Florian Jamain; Daniel Vanderpooten (Oper. Res. Lett., 2015)

Partial preference models using translated cones in discrete multi-objective optimization. - Sami Kaddani; Satya Tamby; Daniel Vanderpooten; Jean Michel Vanpeperstraete (SSCI, 2016)

Robust capacity expansion of a network under demand uncertainty: A bi-objective approach. - Hassene Aissi; Daniel Vanderpooten (Networks, 2016)

Perturbed Decomposition Algorithm applied to the multi-objective Traveling Salesman Problem. - Marek Cornu; Tristan Cazenave; Daniel Vanderpooten (Comput. Oper. Res., 2017)

Discrete representation of the non-dominated set for multi-objective optimization problems using kernels. - Cristina Bazgan; Florian Jamain; Daniel Vanderpooten (Eur. J. Oper. Res., 2017)

Efficient computation of the search region in multi-objective optimization. - Kerstin Dächert; Kathrin Klamroth; Renaud Lacour; Daniel Vanderpooten (Eur. J. Oper. Res., 2017)

Weighted sum model with partial preference information: Application to multi-objective optimization. - Sami Kaddani; Daniel Vanderpooten; Jean Michel Vanpeperstraete; Hassene Aissi (Eur. J. Oper. Res., 2017)

Covers and approximations in multiobjective optimization. - Daniel Vanderpooten; Lakmali Weerasena; Margaret M. Wiecek (J. Glob. Optim., 2017)

Bi-objective matchings with the triangle inequality. - Laurent Gourvès; Jérôme Monnot; Fanny Pascual; Daniel Vanderpooten (Theor. Comput. Sci., 2017)

An FPTAS for a General Class of Parametric Optimization Problems. - Cristina Bazgan; Arne Herzel; Stefan Ruzika; Clemens Thielen; Daniel Vanderpooten (COCOON, 2019)

Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems. - Satya Tamby; Daniel Vanderpooten (INFORMS J. Comput., 2021)

One-exact approximate Pareto sets. - Arne Herzel; Cristina Bazgan; Stefan Ruzika; Clemens Thielen; Daniel Vanderpooten (J. Glob. Optim., 2021)

Exact and approximate determination of the Pareto set using minimal correction subsets. - Andreia P. Guerreiro; João Cortes; Daniel Vanderpooten; Cristina Bazgan; Inês Lynce; Vasco Manquinho; José Rui Figueira (CoRR, 2022)

An approximation algorithm for a general class of parametric optimization problems. - Cristina Bazgan; Arne Herzel; Stefan Ruzika; Clemens Thielen; Daniel Vanderpooten (J. Comb. Optim., 2022)

The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems. - Cristina Bazgan; Stefan Ruzika; Clemens Thielen; Daniel Vanderpooten (Theory Comput. Syst., 2022)

Optimizing over the Efficient Set of a Multi-Objective Discrete Optimization Problem. - Satya Tamby; Daniel Vanderpooten (SEA, 2023)

Exact and approximate determination of the Pareto front using Minimal Correction Subsets. - Andreia P. Guerreiro; João Cortes; Daniel Vanderpooten; Cristina Bazgan; Inês Lynce; Vasco Manquinho; José Rui Figueira (Comput. Oper. Res., 2023)

Computing efficiently the nondominated subset of a set sum. - Antoine Kerberenes; Daniel Vanderpooten; Jean Michel Vanpeperstraete (Int. Trans. Oper. Res., 2023)

Approximating multiobjective optimization problems: How exact can you be? - Cristina Bazgan; Arne Herzel; Stefan Ruzika; Clemens Thielen; Daniel Vanderpooten (Math. Methods Oper. Res., 2024)

A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem. - Cristina Bazgan; Johannes Kager; Clemens Thielen; Daniel Vanderpooten (Networks, 2025)

Grouping Strategies on Two-Phase Methods for Bi-objective Combinatorial Optimization. - Felipe O. Mota; Luís Paquete; Daniel Vanderpooten (CoRR, 2025)