The following pages link to Anthony Przybylski (Q319371):
Displayed 10 items.
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373) (← links)
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case (Q339612) (← links)
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives (Q429651) (← links)
- An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem (Q785628) (← links)
- Multi-objective branch and bound (Q1753506) (← links)
- Two phase algorithms for the bi-objective assignment problem (Q2455615) (← links)
- The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm (Q2496036) (← links)
- Branch-and-bound and objective branching with three or more objectives (Q2676405) (← links)
- A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme (Q2899069) (← links)
- (Q3109954) (← links)