2013

Articles

• Figueira, José ; Paquete, Luis ; Simoes, Marco ; Vanderpooten, Daniel . Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem. Computational Optimization and Applications. 2013. Springer. DOI http://dx.doi.org/10.1007/s10589-013-9551-x.
• Bazgan, Cristina ; Toubaline, Sonia ; Vanderpooten, Daniel . Complexity of determining the most vital elements for the p-median and p-center location problems. Journal of Combinatorial Optimization. Volume 25. n° 2. 2013. pages 191-207. Springer. DOI http://dx.doi.org/10.1007/s10878-012-9469-8.
• Bazgan, Cristina ; Toubaline, Sonia ; Vanderpooten, Daniel . Critical edges/nodes for the minimum spanning tree problem: complexity and approximation. Journal of Combinatorial Optimization. Volume 26. n° 1. 2013. pages 178-189. Springer. DOI http://dx.doi.org/10.1007/s10878-011-9449-4.

2012

Articles

• Kalai-Jemai, Rim ; Lamboray, Claude ; Vanderpooten, Daniel . Lexicographic α-robustness : an alternative to min-maxcriteria. European Journal of Operational Research. Volume 220. n° 3. 2012. pages 722-728. Elsevier. DOI http://dx.doi.org/10.1016/j.ejor.2012.01.056.

2011

Articles

• Kalaï, Rim ; Vanderpooten, Daniel . The lexicographic α-robust knapsack problem. International Transactions in Operational Research. Volume 18. n° 1. 2011. pages 103-113. Wiley. DOI http://dx.doi.org/10.1111/j.1475-3995.2010.00786.x.
• Vanderpooten, Daniel ; Kornman, Sylvie ; Bellosta, Marie-Jo . Preference-based English reverse auctions. Artificial Intelligence. Volume 175. n° 7-8. 2011. pages 1449-1467. Elsevier. DOI http://dx.doi.org/10.1016/j.artint.2010.11.015.

Book chapters

• Vanderpooten, Daniel ; Bouyssou, Denis . Bernard Roy. Gass, Saul I.; Assad, Arjang A. Profiles in Operations Research: Pioneers and Innovators. New York. 2011. pages 753-773.

Conference Contributions

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

2010

Articles

• Vanderpooten, Daniel ; Bazgan, Cristina ; Aissi, Hassene . General approximation schemes for min–max (regret) versions of some (pseudo-)polynomial problems. Discrete Optimization. Volume 7. n° 3. 2010. pages 136-148. Elsevier. DOI http://dx.doi.org/10.1016/j.disopt.2010.03.004.
• Bazgan, Cristina ; Tuza, Zsolt ; Vanderpooten, Daniel . Satisfactory graph partition, variants, and generalizations. European Journal of Operational Research. Volume 206. n° 2. 2010. pages 271-280. Elsevier. DOI http://dx.doi.org/10.1016/j.ejor.2009.10.019.
• Kalaï, Rim ; Aloulou, Mohamed Ali ; Vallin, Philippe ; Vanderpooten, Daniel . Lexicographic α-robustness: an application to the 1-median problem. RAIRO Operations Research. Volume 44. n° 2. 2010. pages 119-138. EDP Sciences. DOI http://dx.doi.org/10.1051/ro/2010010.

Conference Contributions

• Aloulou, Mohamed Ali ; Bouzaiene, Afef ; Dridi, Najoua ; Vanderpooten, Daniel . The two-machine flow-shop serial-batching scheduling problem with limited batch size. 12th International Conference on Project Management and Scheduling (PMS 2010). Tours. France. 2010.
• Vanderpooten, Daniel ; Toubaline, Sonia ; Bazgan, Cristina . Complexity of determining the most vital elements for the 1-median and 1-center location problems. Combinatorial Optimization and Combinatorial Optimization and Applications 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I. Kailua-Kona. États-Unis. 2010.
• Aloulou, Mohamed Ali ; Dridi, Najoua ; Bouzaiene, Afef ; Vanderpooten, Daniel . A bicriteria flow-shop scheduling problem with two serial batching machines. Electronic Notes in Discrete Mathematics. Hammamet. Tunisie. 2010.

2009

Articles

• Bazgan, Cristina ; Hugot, Hadrien ; Vanderpooten, Daniel . Implementing an efficient fptas for the 0–1 multi-objective knapsack problem. European Journal of Operational Research. Volume 198. n° 1. 2009. pages 47-56. Elsevier. DOI http://dx.doi.org/10.1016/j.ejor.2008.07.047.
• Aissi, Hassene ; Bazgan, Cristina ; Vanderpooten, Daniel . Min–max and min–max regret versions of combinatorial optimization problems: A survey. European Journal of Operational Research. Volume 197. n° 2. 2009. pages 427-438. Elsevier. DOI http://dx.doi.org/10.1016/j.ejor.2008.09.012.
• Vanderpooten, Daniel ; Hugot, Hadrien ; Bazgan, Cristina . Solving efficiently the 0-1 multi-objective knapsack problem. Computers and Operations Research. Volume 36. n° 1. 2009. pages 260-279. Elsevier. DOI http://dx.doi.org/10.1016/j.cor.2007.09.009.

Book chapters

• Vanderpooten, Daniel . Introduction à l'aide multicritère à la décision. Faure, Robert; Lemaire, Bernard; Picouleau, Christophe. Précis de recherche opérationnelle : méthodes et exercices d'application. Paris. 2009. pages 419-441.

2008

Articles

• Vanderpooten, Daniel ; Farah, Mohamed . An outranking approach for information retrieval. Journal of Information Retrieval. Volume 11. n° 4. 2008. pages 315-334. Springer. DOI http://dx.doi.org/10.1007/s10791-008-9046-z.
• Bellosta, Marie-Jo ; Kornman, Sylvie ; Vanderpooten, Daniel . A unified framework for multiple criteria auction mechanisms. Web Intelligence and Agent Systems. Volume 6. n° 4. 2008. pages 401-419. IOS Press. DOI http://dx.doi.org/10.3233/WIA-2008-0148.
• Vanderpooten, Daniel ; Bazgan, Cristina ; Aissi, Hassene . Complexity of the min-max (regret) versions of cut problems. Discrete Optimization. Volume 5. n° 1. 2008. pages 66-73. Elsevier Ltd. DOI http://dx.doi.org/10.1016/j.disopt.2007.11.008.
• Bazgan, Cristina ; Tuza, Zsolt ; Vanderpooten, Daniel . Approximation of satisfactory bisection problems. Journal of Computer and System Science. Volume 74. n° 5. 2008. pages 875-883. Elsevier. DOI http://dx.doi.org/10.1016/j.jcss.2007.12.001.

2007

Articles

• Aissi, Hassene ; Bazgan, Cristina ; Vanderpooten, Daniel . Approximation of min-max and min-max regret versions of some combinatorial optimization problems. European Journal of Operational Research. Volume 179. n° 2. 2007. pages 281-290. Elsevier. DOI http://dx.doi.org/10.1016/j.ejor.2006.03.023.
• Bazgan, Cristina ; Tuza, Zsolt ; Vanderpooten, Daniel . Efficient algorithms for decomposing graphs under degree constraints. Discrete Applied Mathematics. Volume 155. n° 8. 2007. pages 979-988. Elsevier. DOI http://dx.doi.org/10.1016/j.dam.2006.10.005.
• Buchanan, John ; Vanderpooten, Daniel . Ranking projects for an electricity utility using ELECTRE III. International Transactions in Operational Research. Volume 14. n° 4. 2007. pages 309-323. Wiley InterScience. DOI http://dx.doi.org/10.1111/j.1475-3995.2007.00589.x.
• Kazakci, Akin Osman ; Rozakis, Stelios ; Vanderpooten, Daniel . Energy crop supply in France: a min-max regret approach. Journal of the Operational Research Society. Volume 58. n° 11. 2007. pages 1470-1479. Palgrave. DOI http://dx.doi.org/10.1057/palgrave.jors.2602284.
• Bellosta, Marie-Jo ; Brigui, Imène ; Kornman, Sylvie ; Pinson, Suzanne ; Vanderpooten, Daniel . Système multi-agents pour des enchères multicritères : modèle et expérimentations. Revue d'Intelligence Artificielle. Volume 21. n° 5-6. 2007. pages 703-727. Hermes. DOI http://dx.doi.org/10.3166/ria.21.703-727.

Conference Contributions

• Bazgan, Cristina ; Hugot, Hadrien ; Vanderpooten, Daniel . A practical efficient fptas for the 0-1 multi-objective knapsack problem. 15th Annual European Symposium on Algorithms (ESA 2007). Berlin. Israël. 2007.
• Bazgan, Cristina ; Hugot, Hadrien ; Vanderpooten, Daniel . An efficient implementation for the 0-1 multi-objective knapsack problem. 6th Workshop on Experimental Algorithms (WEA'07). Berlin. Italie. 2007.
• Vanderpooten, Daniel ; Farah, Mohamed . An outranking approach for rank aggregation in Information Retrieval. ACM SIGIR Forum. Amsterdam. Pays-Bas. 2007.
• Farah, Mohamed ; Vanderpooten, Daniel . L'agrégation en recherche d'information : une revue critique des principaux modèles théoriques de recherche d'information. COnférence en Recherche d'Infomations et Applications - CORIA 2007, 4th French Information Retrieval Conference, Saint-Étienne, France, March 28-30, 2007. Proceedings. St Etienne. France. 2007.

2006

Articles

• Bazgan, Cristina ; Tuza, Zsolt ; Vanderpooten, Daniel . Degree-constrained decompositions of graphs: bounded treewidth and planarity. Theoretical Computer Science. Volume 355. n° 3. 2006. pages 389-395. Elsevier. DOI http://dx.doi.org/10.1016/j.tcs.2006.01.024.
• Vanpeperstraete, Jean-Michel ; Vanderpooten, Daniel ; Hugot, Hadrien . A bi-criteria approach for the data association problem. Annals of Operations Research. Volume 147. n° 1. 2006. pages 217-234. Springer. DOI http://dx.doi.org/10.1007/s10479-006-0069-9.
• Bazgan, Cristina ; Tuza, Zsolt ; Vanderpooten, Daniel . The satisfactory partition problem. Discrete Applied Mathematics. Volume 154. n° 8. 2006. pages 1236-1245. Elsevier. DOI http://dx.doi.org/10.1016/j.dam.2005.10.014.

Conference Contributions

• Vanderpooten, Daniel ; Kalaï, Rim . Lexicographic alpha-robust knapsack problems: complexity results. International Conference on Services Systems and Services Management (ICSSSM'06) Proceedings. Troyes. France. 2006.
• Farah, Mohamed ; Vanderpooten, Daniel . A multiple criteria approach for Information Retrieval. 13th International Conference on String Processing and Information Retrieval (SPIRE 2006). Glasgow. Royaume-Uni. 2006.
• Aissi, Hassene ; Bazgan, Cristina ; Vanderpooten, Daniel . Approximating min-max (regret) versions of some polynomial problems. 12th Annual International Conference on Computing and Combinatorics (COCOON 2006). Taipei. Taïwan. 2006.
• Farah, Mohamed ; Saad, Inès ; Rosenthal-Sabroux, Camille ; Vanderpooten, Daniel . A multicriteria framework for locating and retrieving crucial knowledge. International Conference on Creativity and Innovation in Decision Making and Decision Support (CIDMDS 2006). Londres. Royaume-Uni. 2006.
• Bellosta, Marie-Jo ; Kornman, Sylvie ; Vanderpooten, Daniel . Un cadre général pour les enchères multicritères. Quinzième congrès francophone Reconnaissance des formes et intelligence artificielle (RFIA 2006). Tours. France. 2006.

Working Papers

• Kalaï, Rim ; Aloulou, Mohamed Ali ; Vallin, Philippe ; Vanderpooten, Daniel . Minmax regret 1-center problem on a network with a discrete set of scenarios. Université Paris-Dauphine . 2006 .

2005

Articles

• Aissi, Hassene ; Bazgan, Cristina ; Vanderpooten, Daniel . Complexity of the min-max and min-max regret assignment problems. Operations Research Letters. Volume 33. n° 6. 2005. pages 634-640. Elsevier. DOI http://dx.doi.org/10.1016/j.orl.2004.12.002.

Conference Contributions

• Farah, Mohamed ; Vanderpooten, Daniel . A multicriteria paradigm of relevance for the Web Information Retrieval problem. 3rd international Conference on Sciences of Electronic, Technologies of Information and Telecommunications (SETIT 2005). Sousse. Tunisie. 2005.
• Bazgan, Cristina ; Tuza, Zsolt ; Vanderpooten, Daniel . Complexity and approximation of satisfactory partition problems. 11th Annual International Conference on Computing and Combinatorics (COCOON 2005). Kunming. Chine. 2005.
• Aissi, Hassene ; Bazgan, Cristina ; Vanderpooten, Daniel . Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack. 13th Annual European Symposium on Algorithms (ESA 2005). Berlin. Espagne. 2005.
• Bellosta, Marie-Jo ; Kornman, Sylvie ; Vanderpooten, Daniel . A framework for multiple criteria English reverse auctions. 2005 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT 2005). Compiègne. France. 2005.
• Vanpeperstraete, Jean-Michel ; Aissi, Hassene ; Vanderpooten, Daniel . Robust approaches for the data association problem. 8th International Conference on Information Fusion, 2005. Philadelphie. États-Unis. 2005.
• Aissi, Hassene ; Bazgan, Cristina ; Vanderpooten, Daniel . Pseudo-polynomial algorithms for min-max and min-max regret problems. Operations Research and Its Applications. The Fifth International Symposium, ISORA’05 Tibet, China, August 8–13, 2005 Proceedings. Beijing. Chine. 2005.
• Aissi, Hassene ; Bazgan, Cristina ; Vanderpooten, Daniel . Complexity of the min-max (regret) versions of cut problems. 16th International Symposium on Algorithms and Computation (ISAAC 2005). Sanya (Hainan). Chine. 2005.
• Kalaï, Rim ; Aloulou, Mohamed Ali ; Vallin, Philippe ; Vanderpooten, Daniel . Robust 1-median location problem on a tree. Operational Research Peripatetic Postgraduate Programme (ORP3 2005). Valence. Espagne. 2005.

2004

Conference Contributions

• Bellosta, Marie-Jo ; Brigui, Imène ; Kornman, Sylvie ; Vanderpooten, Daniel . A multi-criteria model for electronic auctions. 19th Annual ACM Symposium on Applied Computing (SAC 2004). Nicosie. Chypre. 2004.
• Farah, Mohamed ; Vanderpooten, Daniel . Novel Approaches in Text Information Retrieval: Experiments in the Web Track of TREC 2004. Proceedings of the Thirteenth Text REtrieval Conference, TREC 2004, Gaithersburg, Maryland, November 16-19, 2004. Gaithersburg. États-Unis. 2004.
• Brigui, Imène ; Bellosta, Marie-Jo ; Kornman, Sylvie ; Pinson, Suzanne ; Vanderpooten, Daniel . Un mécanisme de négociation multicritère pour le commerce électronique. 14ème Congrès Francophone AFRIF-AFIA de Reconnaissance des Formes et Intelligence Artificielle. Toulouse. France. 2004.

2003

Articles

• Azibi, Riad ; Vanderpooten, Daniel . Aggregation of dispersed consequences for constructing criteria: the evaluation of flood risk reduction strategies. European Journal of Operational Research. Volume 144. n° 2. 2003. pages 397-411. Elsevier. DOI http://dx.doi.org/10.1016/S0377-2217(01)00400-3.

Conference Contributions

• Bazgan, Cristina ; Tuza, Zsolt ; Vanderpooten, Daniel . On the existence and determination of satisfactory partitions in a graph. 14th Annual International Symposium on Algorithms and Computation (ISAAC 2003). Kyoto. Japon. 2003.

Working Papers

• Bazgan, Cristina ; Tuza, Zsolt ; Vanderpooten, Daniel . Decomposition of graphs: some polynomial cases. . 2003 .
• Bazgan, Cristina ; Tuza, Zsolt ; Vanderpooten, Daniel . Complexity of the satisfactory partition problem. . 2003 .

2002

Articles

• Gabrel, Virginie ; Vanderpooten, Daniel . Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an Earth observing satellite. European Journal of Operational Research. Volume 139. n° 3. 2002. pages 533-542. Elsevier. DOI http://dx.doi.org/10.1016/S0377-2217(01)00188-6.
• Azibi, Riad ; Vanderpooten, Daniel . Construction of rule-based assignment models. European Journal of Operational Research. Volume 138. n° 2. 2002. pages 274-293. Elsevier. DOI http://dx.doi.org/10.1016/S0377-2217(01)00246-6.

2001

Articles

• Rozakis, Stelios ; Sourie, Jean-Claude ; Vanderpooten, Daniel . Integrated micro-economic modelling and multi-criteria methodology to support public decision-making: the case of liquid bio-fuels in France. Biomass & Bioenergy. Volume 20. n° 5. 2001. pages 385-398. Elsevier. DOI http://dx.doi.org/10.1016/S0961-9534(01)00004-6.
• Stefanowski, Jerzy ; Vanderpooten, Daniel . Induction of decision rules in classification and discovery-oriented perspectives. International Journal on Intelligent Systems. Volume 16. n° 1. 2001. pages 13-27. Wiley InterScience. DOI http://dx.doi.org/10.1002/1098-111X(200101)16:1<13::AID-INT3>3.0.CO;2-M.

2000

Articles

• Slowinski, Roman ; Vanderpooten, Daniel . A generalized definition of rough approximations based on similarity. IEEE Transactions on Data and Knowledge Engineering. Volume 12. n° 2. 2000. pages 331-336. IEEE. DOI http://doi.ieeecomputersociety.org/10.1109/69.842271.