Anthony Przybylski

发表

Exact Methods for Multi-Objective Combinatorial Optimisation

X. Gandibleux, M. Ehrgott, Anthony Przybylski, 2016 .

A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives

Anthony Przybylski, Xavier Gandibleux, Matthias Ehrgott, 2010, Discret. Optim..

Two phase algorithms for the bi-objective assignment problem

Anthony Przybylski, Xavier Gandibleux, Matthias Ehrgott, 2008, Eur. J. Oper. Res..

A Simple and Efficient Dichotomic Search Algorithm for Multi-Objective Mixed Integer Linear Programmes

Anthony Przybylski, Kathrin Klamroth, Renaud Lacour, 2019 .

On branching heuristics for the bi-objective 0/1 unidimensional knapsack problem

X. Gandibleux, Anthony Przybylski, F. Saubion, 2017, Journal of Heuristics.

An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem

S. Ruzika, Anthony Przybylski, Pascal Halffmann, 2020, Journal of Global Optimization.

A simple and efficient dichotomic search algorithm for multi-objective mixed integer linear programs pdf

Anthony Przybylski, Kathrin Klamroth, Renaud Lacour, 2019, ArXiv.

A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme

Anthony Przybylski, Xavier Gandibleux, Matthias Ehrgott, 2010, INFORMS J. Comput..

The biobjective integer minimum cost flow problem - incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm

Anthony Przybylski, Matthias Ehrgott, Xavier Gandibleux, 2006, Comput. Oper. Res..

Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case

Anthony Przybylski, Xavier Gandibleux, Thomas Vincent, 2013, Comput. Oper. Res..

An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem

Anthony Przybylski, Stefan Ruzika, Tobias Dietz, 2020, J. Glob. Optim..

The Biobjective Assignment Problem

Anthony Przybylski, Xavier Gandibleux, Matthias Ehrgott, 2006 .

Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems

Anthony Przybylski, Xavier Gandibleux, Audrey Cerqueus, 2015, Eur. J. Oper. Res..