The biobjective integer minimum cost flow problem - incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm. - Anthony Przybylski; Xavier Gandibleux; Matthias Ehrgott (Comput. Oper. Res., 2006)

Two phase algorithms for the bi-objective assignment problem. - Anthony Przybylski; Xavier Gandibleux; Matthias Ehrgott (Eur. J. Oper. Res., 2008)

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 (Discret. Optim., 2010)

A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme. - Anthony Przybylski; Xavier Gandibleux; Matthias Ehrgott (INFORMS J. Comput., 2010)

Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case. - Thomas Vincent; Florian Seipp; Stefan Ruzika; Anthony Przybylski; Xavier Gandibleux (Comput. Oper. Res., 2013)

Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems. - Audrey Cerqueus; Anthony Przybylski; Xavier Gandibleux (Eur. J. Oper. Res., 2015)

Multi-objective branch and bound. - Anthony Przybylski; Xavier Gandibleux (Eur. J. Oper. Res., 2017)

On branching heuristics for the bi-objective 0/1 unidimensional knapsack problem. - Audrey Cerqueus; Xavier Gandibleux; Anthony Przybylski; Frédéric Saubion (J. Heuristics, 2017)

A simple and efficient dichotomic search algorithm for multi-objective mixed integer linear programs. - Anthony Przybylski; Kathrin Klamroth; Renaud Lacour (CoRR, 2019)

An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem. - Pascal Halffmann; Tobias Dietz; Anthony Przybylski; Stefan Ruzika (J. Glob. Optim., 2020)

Branch-and-bound and objective branching with three or more objectives. - Nicolas Forget; Sune Lauth Gadegaard; Kathrin Klamroth; Lars Relund Nielsen; Anthony Przybylski (Comput. Oper. Res., 2022)