References

A selection of scientific productions arising out of the project:

2018:

  • Quentin Delmée, Xavier Gandibleux, Anthony Przybylski. An algorithm for the exact solution of Bi-Objective Mixed 0-1 Capacitated Facility Location ProblemOR 2018: International Conference on Operations Research. September 12-14, 2018, Brussels, Belgium.

  • Xavier Gandibleux, Anthony Przybylski. Algorithmes de branch-and-bound multiobjectif et vOptSolver. Tutorial du GDR RO à ROADEF2018 : 19ème congrès annuel de la Société Française de Recherche Opérationnelle et d’Aide à la Décision, février 2018, Lorient, France. 2018. Suivre la présentation sur youtube sur ce lien.
  • Anthony Przybylski, Kathrin Klamroth et Britta Schulze. A Parametric Method to Determine the Optimal Convex Surrogate Upper Bound Set for the Bi-Objective Bi-Dimensional Knapsack Problem. ROADEF2018 : 19ème congrès annuel de la Société Française de Recherche Opérationnelle et d’Aide à la Décision, février 2018, Lorient, France. 2018.

2017:

  • Audrey Cerqueus, Xavier Gandibleux, Anthony Przybylski, Frédéric Saubion. On branching heuristics for the bi-objective  0/1 unidimensional knapsack problem. Journal of Heuristics (accepted), 2017.
  • Xavier Gandibleux, Gauthier Soleilhac, Anthony Przybylski, Flavien Lucas, Stefan Ruzika, Pascal Halffmann. vOptSolver,   a   « get   and   run »   solver   of multiobjective  linear  optimization  problems  built  on Julia and JuMP. MCDM2017: 24th International Conference on Multiple Criteria Decision Making. July 10-14, 2017. Ottawa (Canada).
  • Xavier Gandibleux, Gauthier Soleilhac, Anthony Przybylski, Stefan Ruzika. vOptSolver: An open source software environment for multiobjective mathematical optimization. IFORS2017: 21st Conference of the International Federation of Operational Research Societies. July 17-21, 2017. Quebec city (Canada).
  • Anthony Przybylski, Xavier Gandibleux. Multi-objective Branch and BoundEuropean Journal of Operational Research (accepted; available online), 2017.
  • Xavier Gandibleux. Peek – Shape – Grab: a methodology in three stages for approximating the non-dominated points of multiobjective discrete combinatorial optimization problems with a multiobjective metaheuristic.
    EMO’2017: 9th International Conference on Evolutionary Multi-Criterion Optimization, March 2017, Münster, Germany. 15 p., 2017, Lecture Note in Computer Science (to appear).
  • Quentin Delmée, Xavier Gandibleux, Anthony Przybylski. Résolution exacte du problème de localisation de services bi-objectif sans contrainte de capacité en variables mixtes. ROADEF2017 : 18ème congrès annuel de la Société Française de Recherche Opérationnelle et d’Aide à la Décision, Feb 2017, Metz, France. 2017.
  • Xavier Gandibleux. Peek–Shape–Grab pour approcher efficacement Y_N. ROADEF2017 : 18ème congrès annuel de la Société Française de Recherche Opérationnelle et d’Aide à la Décision, Feb 2017, Metz, France. 2017.
  • José Rui Figueira, Carlos M Fonseca, Pascal Halffmann, Kathrin Klamroth, Luís Paquete, Stefan Ruzika, Britta Schulze, Michael Stiglmayr, David Willems. Easy to say they are Hard, but Hard to see they are Easy — Towards a Categorization of Tractable Multiobjective Combinatorial Optimization Problems. Journal of Multi-Criterial Decision Analysis, Volume 24, 82-98, January 2017.
  • Kathrin Klamroth, Sanaz Mostaghim, Borias Naujoks, Silvia Poles, Robin Purshouse, Günter Rudolph, Stefan Ruzika, Serpil Sayin, Margaret Wiecek, Xin Yao. Multiobjective optimization for interwoven systems. Journal of Multi-Criteria Decision Analysis, Volume 24, 71-81, January 2017.
  • Alberto Giudici, Pascal Halffmann, Stefan Ruzika, Clemens Thielen. Approximation schemes for the parametric knapsack problem. Information Processing Letters, Volume 120, 11-15, April 2017.
  • Stefan Ruzika. General Approximation Methods for Bicriteria Minimization. Guest Lecture at Université Paris-Dauphine, Paris, France. 2017.
  • Pascal Halffmann. Partial Scalarization – A New Method for Solving Multi Objective (Mixed-Integer) Linear Problems? Seminar at University of Koblenz-Landau, Germany. 2017.

2016:

  • Matthias Ehrgott, Xavier Gandibleux, Anthony Przybylski. Exact Methods for Multi-Objective Combinatorial Optimisation. In Multiple Criteria Decision Analysis: State of the Art Surveys (Salvatore Greco, Matthias Ehrgott,and José Figueira). Volume 233 of the series International Series in Operations Research & Management Science. Chapter 19, Pages 817-850, Springer New York, 2016.
  • Audrey Cerqueus, Xavier Gandibleux, Anthony Przybylski, Frédéric Saubion, Stefan Ruzika. Branch-and-cut bi-objectif appliqué au problème du sac-à-dos bi-dimensionnel. ROADEF201617ème congrès annuel de la Société Française de Recherche Opérationnelle et d’Aide à la Décision, 2016, Compiègne, France.
  • Quentin Delmée, Kathrin Klamroth, Anthony Przybylski. Utilisation de la relaxation lagrangienne pour déterminer des ensembles bornants inférieurs pour le problème de voyageur de commerce bi-objectif. 17ème congrès annuel de la Société Française de Recherche Opérationnelle et d’Aide à la Décision, 2016, Compiègne, France.
  • Stefan Ruzika. A General Bicriteria Approximation Algorithm. INFORMS Annual Meeting, Nashville, TN, USA, 2016.
  • Stefan Ruzika. Recent Trends in Multiobjective Programming. Guest Lecture at Fuzhou University, Fuzhou, China, 2016.
  • Pascal Halffmann. Optimality in Multi Objective Optimization. Seminar at University of Koblenz-Landau, Germany. 2016.
  • Stefan Ruzika. A General Bicriteria Approximation Algorithm. Guest Lecture at Universität Göttingen, Germany. 2016.

2015:

  • Audrey Cerqueus, Anthony Przybylski, Xavier Gandibleux. Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems. European Journal of Operational Research, 244(2), 417-433, July 2015.
  • Audrey Cerqueus, Xavier Gandibleux, Anthony Przybylski, Stefan Ruzika, Frédéric Saubion. A branch-and-cut method for the bi-objective bi-dimensional knapsack problem. 23nd International Conference on Multiple Criteria Decision Making, 2015, Hamburg, Germany.
  • Audrey Cerqueus, Xavier Gandibleux, Anthony Przybylski, Stefan Ruzika, Frédéric Saubion. A branch-and-cut method for the bi-objective bi-dimensional knapsack problem. Workshop Recent Advances in Multi-Objective Optimization, 2015, Nantes, France.
  • Stefan Ruzika. Why would you ever « vectorize » a single objective optimization problem? Workshop Recent Advances in Multi-Objective Optimization, 2015, Nantes, France.
  • Stefan Ruzika. Toward a Methodology of Combining Optimization Models. Meeting of the Association of European Operational Research Societies EURO2015, Glasgow, United Kingdom. 2015.
  • Audrey Cerqueus Bi-objective branch-and-cut algorithms applied to the binary knapsack problem. Phd Thesis, Université de Nantes, Nantes, France. 2015. 

Previous references directly connected to the project:

  • Thomas Vincent, Florian Seipp, Stefan Ruzika, Anthony Przybylski, Xavier Gandibleux. Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case. Computers & Operations Research, Volume 40, Issue 1, Pages 498–509.  2013.
  • Thomas Vincent. Caractérisation des solutions efficaces et algorithmes d’énumération exacts pour l’optimisation multiobjectif en variables mixtes binairesPhD thesis (in French), Université de Nantes, Nantes, France. 2013.
  • Ellen De Schepper, Steven Van Passel, Sebastien Lizin, Thomas Vincent, Benjamin Martin, Xavier Gandibleux. Economic and environmental multi-objective optimisation to evaluate the impact of Belgian policy on solar power and electric vehicles. Journal of Environmental Economics and Policy. Volume 5, Number 1, Pages 1-27, 2016.