default search action
Daniel Vanderpooten
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j53]Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen
, Daniel Vanderpooten:
Approximating multiobjective optimization problems: How exact can you be? Math. Methods Oper. Res. 100(1): 5-25 (2024) - 2023
- [j52]Andreia P. Guerreiro, João Cortes, Daniel Vanderpooten, Cristina Bazgan, Inês Lynce
Exact and approximate determination of the Pareto front using Minimal Correction Subsets. Comput. Oper. Res. 153: 106153 (2023) - [j51]Antoine Kerberenes, Daniel Vanderpooten, Jean Michel Vanpeperstraete:
Computing efficiently the nondominated subset of a set sum. Int. Trans. Oper. Res. 30(6): 3455-3478 (2023) - [c21]Satya Tamby, Daniel Vanderpooten:
Optimizing over the Efficient Set of a Multi-Objective Discrete Optimization Problem. SEA 2023: 9:1-9:13 - [i5]Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
Approximating Multiobjective Optimization Problems: How exact can you be? CoRR abs/2305.15142 (2023) - 2022
- [j50]Cristina Bazgan, Arne Herzel
An approximation algorithm for a general class of parametric optimization problems. J. Comb. Optim. 43(5): 1328-1358 (2022) - [j49]Cristina Bazgan, Stefan Ruzika, Clemens Thielen
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems. Theory Comput. Syst. 66(1): 395-415 (2022) - [i4]Andreia P. Guerreiro, João Cortes
Exact and approximate determination of the Pareto set using minimal correction subsets. CoRR abs/2204.06908 (2022) - 2021
- [j48]Satya Tamby
Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems. INFORMS J. Comput. 33(1): 72-85 (2021) - [j47]Arne Herzel
One-exact approximate Pareto sets. J. Glob. Optim. 80(1): 87-115 (2021)
2010 – 2019
- 2019
- [c20]Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
An FPTAS for a General Class of Parametric Optimization Problems. COCOON 2019: 25-37 - [i3]Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems. CoRR abs/1908.01181 (2019) - [i2]Arne Herzel, Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
One-Exact Approximate Pareto Sets. CoRR abs/1908.10561 (2019) - 2017
- [j46]Marek Cornu, Tristan Cazenave, Daniel Vanderpooten
Perturbed Decomposition Algorithm applied to the multi-objective Traveling Salesman Problem. Comput. Oper. Res. 79: 314-330 (2017) - [j45]Sami Kaddani
Weighted sum model with partial preference information: Application to multi-objective optimization. Eur. J. Oper. Res. 260(2): 665-679 (2017) - [j44]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): 814-827 (2017) - [j43]Kerstin Dächert, Kathrin Klamroth
Efficient computation of the search region in multi-objective optimization. Eur. J. Oper. Res. 260(3): 841-855 (2017) - [j42]Daniel Vanderpooten
Covers and approximations in multiobjective optimization. J. Glob. Optim. 67(3): 601-619 (2017) - [j41]Laurent Gourvès, Jérôme Monnot, Fanny Pascual, Daniel Vanderpooten
Bi-objective matchings with the triangle inequality. Theor. Comput. Sci. 670: 1-10 (2017) - 2016
- [j40]Hassene Aissi, Daniel Vanderpooten
Robust capacity expansion of a network under demand uncertainty: A bi-objective approach. Networks 68(3): 185-199 (2016) - [c19]Sami Kaddani
Partial preference models using translated cones in discrete multi-objective optimization. SSCI 2016: 1-8 - 2015
- [j39]Yann Dujardin, Daniel Vanderpooten
A multi-objective interactive system for adaptive traffic control. Eur. J. Oper. Res. 244(2): 601-610 (2015) - [j38]Kathrin Klamroth
On the representation of the search region in multi-objective optimization. Eur. J. Oper. Res. 245(3): 767-778 (2015) - [j37]Cristina Bazgan, Florian Jamain, Daniel Vanderpooten
Approximate Pareto sets of minimal size for multi-objective optimization problems. Oper. Res. Lett. 43(1): 1-6 (2015) - [i1]Kathrin Klamroth, Renaud Lacour, Daniel Vanderpooten:
On the representation of the search region in multi-objective optimization. CoRR abs/1502.06111 (2015) - 2014
- [j36]Lyes Belhoul
An efficient procedure for finding best compromise solutions to the multi-objective assignment problem. Comput. Oper. Res. 49: 97-106 (2014) - [j35]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): 17-29 (2014) - 2013
- [j34]José Rui Figueira
Algorithmic improvements on dynamic programming for the bi-objective {0, 1} knapsack problem. Comput. Optim. Appl. 56(1): 97-111 (2013) - [j33]Cristina Bazgan, Florian Jamain, Daniel Vanderpooten
On the number of non-dominated points of a multicriteria optimization problem. Discret. Appl. Math. 161(18): 2841-2850 (2013) - [j32]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): 191-207 (2013) - [j31]Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation. J. Comb. Optim. 26(1): 178-189 (2013) - [j30]Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten
Critical edges for the assignment problem: Complexity and exact resolution. Oper. Res. Lett. 41(6): 685-689 (2013) - 2012
- [j29]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): 2888-2898 (2012) - [j28]Rim Kalaï, Claude Lamboray, Daniel Vanderpooten
Lexicographic α-robustness: An alternative to min-max criteria. Eur. J. Oper. Res. 220(3): 722-728 (2012) - 2011
- [j27]Marie-Jo Bellosta, Sylvie Kornman, Daniel Vanderpooten
Preference-based English reverse auctions. Artif. Intell. 175(7-8): 1449-1467 (2011) - [j26]Rim Kalaï, Daniel Vanderpooten
The lexicographic α-robust knapsack problem. Int. Trans. Oper. Res. 18(1): 103-113 (2011) - [c18]Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten
Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem. COCOA 2011: 126-140 - [c17]Yann Dujardin, Florence Boillot, Daniel Vanderpooten
Multiobjective and multimodal adaptive traffic light control on single junctions. ITSC 2011: 1361-1368 - 2010
- [j25]Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems. Discret. Optim. 7(3): 136-148 (2010) - [j24]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: 1177-1184 (2010) - [j23]Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
Satisfactory graph partition, variants, and generalizations. Eur. J. Oper. Res. 206(2): 271-280 (2010) - [j22]Rim Kalaï, Mohamed Ali Aloulou, Philippe Vallin, Daniel Vanderpooten
Lexicographic α-robustness: an application to the 1-median problem. RAIRO Oper. Res. 44(2): 119-138 (2010) - [c16]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: 237-251
2000 – 2009
- 2009
- [j21]Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten
Solving efficiently the 0-1 multi-objective knapsack problem. Comput. Oper. Res. 36(1): 260-279 (2009) - [j20]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): 427-438 (2009) - [j19]Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten
Implementing an efficient fptas for the 0-1 multi-objective knapsack problem. Eur. J. Oper. Res. 198(1): 47-56 (2009) - 2008
- [j18]Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Complexity of the min-max (regret) versions of min cut problems. Discret. Optim. 5(1): 66-73 (2008) - [j17]Mohamed Farah
An outranking approach for information retrieval. Inf. Retr. 11(4): 315-334 (2008) - [j16]Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
Approximation of satisfactory bisection problems. J. Comput. Syst. Sci. 74(5): 875-883 (2008) - [j15]Marie-Jo Bellosta, Sylvie Kornman, Daniel Vanderpooten
A unified framework for multiple criteria auction mechanisms. Web Intell. Agent Syst. 6(4): 401-419 (2008) - 2007
- [j14]Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
Efficient algorithms for decomposing graphs under degree constraints. Discret. Appl. Math. 155(8): 979-988 (2007) - [j13]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): 281-290 (2007) - [j12]John Buchanan, Daniel Vanderpooten:
Ranking projects for an electricity utility using ELECTRE III. Int. Trans. Oper. Res. 14(4): 309-323 (2007) - [j11]A. O. Kazakçi, Stelios Rozakis, Daniel Vanderpooten
Energy crop supply in France: a min-max regret approach. J. Oper. Res. Soc. 58(11): 1470-1479 (2007) - [j10]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): 703-727 (2007) - [c15]Mohamed Farah
L'Agrégation en Recherche d'Information. CORIA 2007: 125-136 - [c14]Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten:
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem. ESA 2007: 717-728 - [c13]Mohamed Farah
An outranking approach for rank aggregation in information retrieval. SIGIR 2007: 591-598 - [c12]Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten:
An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem. WEA 2007: 406-419 - 2006
- [j9]Hadrien Hugot, Daniel Vanderpooten
A bi-criteria approach for the data association problem. Ann. Oper. Res. 147(1): 217-234 (2006) - [j8]Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
The satisfactory partition problem. Discret. Appl. Math. 154(8): 1236-1245 (2006) - [j7]Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
Degree-constrained decompositions of graphs: Bounded treewidth and planarity. Theor. Comput. Sci. 355(3): 389-395 (2006) - [c11]Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten:
Approximating Min-Max (Regret) Versions of Some Polynomial Problems. COCOON 2006: 428-438 - [c10]Marie-Jo Bellosta, Sylvie Kornman, Daniel Vanderpooten
An Agent-Based Mechanism for Autonomous Multiple Criteria Auctions. IAT 2006: 587-594 - [c9]Mohamed Farah, Daniel Vanderpooten:
A Multiple Criteria Approach for Information Retrieval. SPIRE 2006: 242-254 - 2005
- [j6]Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Complexity of the min-max and min-max regret assignment problems. Oper. Res. Lett. 33(6): 634-640 (2005) - [c8]Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
Complexity and Approximation of Satisfactory Partition Problems. COCOON 2005: 829-838 - [c7]Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten:
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack. ESA 2005: 862-873 - [c6]Marie-Jo Bellosta, Sylvie Kornman, Daniel Vanderpooten
A framework for multiple criteria English reverse auctions. IAT 2005: 633-639 - [c5]Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Complexity of the Min-Max (Regret) Versions of Cut Problems. ISAAC 2005: 789-798 - 2004
- [c4]Marie-Jo Bellosta, Imène Brigui, Sylvie Kornman, Daniel Vanderpooten:
A multi-criteria model for electronic auctions. SAC 2004: 759-765 - [c3]Mohamed Farah
Novel Approaches in Text Information Retrieval - Experiments in the Web Track of TREC 2004. TREC 2004 - 2003
- [j5]R. Azibi, Daniel Vanderpooten
Aggregation of dispersed consequences for constructing criteria: The evaluation of flood risk reduction strategies. Eur. J. Oper. Res. 144(2): 397-411 (2003) - [c2]Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
On the Existence and Determination of Satisfactory Partitions in a Graph. ISAAC 2003: 444-453 - 2002
- [j4]R. Azibi, Daniel Vanderpooten
Construction of rule-based assignment models. Eur. J. Oper. Res. 138(2): 274-293 (2002) - [j3]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): 533-542 (2002) - 2001
- [j2]Jerzy Stefanowski, Daniel Vanderpooten:
Induction of decision rules in classification and discovery-oriented perspectives. Int. J. Intell. Syst. 16(1): 13-27 (2001) - 2000
- [j1]Roman Slowinski
A Generalized Definition of Rough Approximations Based on Similarity. IEEE Trans. Knowl. Data Eng. 12(2): 331-336 (2000)
1990 – 1999
- 1993
- [c1]Jerzy Stefanowski, Daniel Vanderpooten:
A General Two-Stage Approach to Inducing Rules from Examples. RSKD 1993: 317-325
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: