Anthony Przybylski

According to our database1, Anthony Przybylski authored at least 10 papers between 2006 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem.
J. Glob. Optim., 2020

2019
A simple and efficient dichotomic search algorithm for multi-objective mixed integer linear programs.
CoRR, 2019

2017
On branching heuristics for the bi-objective 0/1 unidimensional knapsack problem.
J. Heuristics, 2017

Multi-objective branch and bound.
Eur. J. Oper. Res., 2017

2015
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems.
Eur. J. Oper. Res., 2015

2013
Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case.
Comput. Oper. Res., 2013

2010
A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme.
INFORMS J. Comput., 2010

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

2008
Two phase algorithms for the bi-objective assignment problem.
Eur. J. Oper. Res., 2008

2006
The biobjective integer minimum cost flow problem - incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm.
Comput. Oper. Res., 2006


  Loading...