Narrow search
Showing 1 - 6 of 6
Cover Image
Approximate Pareto sets of minimal size for multi-objective optimization problems
Bazgan, Cristina; Jamain, Florian; Vanderpooten, Daniel - In: Operations research letters 43 (2015) 1, pp. 1-6
Persistent link: https://www.econbiz.de/10010486385
Cover Image
Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
Bazgan, Cristina; Jamain, Florian; Vanderpooten, Daniel - In: European journal of operational research : EJOR 260 (2017) 3, pp. 814-827
Persistent link: https://www.econbiz.de/10011713453
Cover Image
A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size
Aloulou, M. A.; Bouzaiene, A.; Dridi, Najoua; … - In: Journal of scheduling 17 (2014) 1, pp. 17-29
Persistent link: https://www.econbiz.de/10010252031
Cover Image
An efficient procedure for finding best compromise solutions to the multi-objective assignment problem
Belhoul, Lyes; Galand, Lucie; Vanderpooten, Daniel - In: Computers & operations research : and their … 49 (2014), pp. 97-106
Persistent link: https://www.econbiz.de/10010383153
Cover Image
Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
Cornu, Marek; Cazenave, Tristan; Vanderpooten, Daniel - In: Computers & operations research : and their … 79 (2017), pp. 314-330
Persistent link: https://www.econbiz.de/10011673547
Cover Image
Exact and approximate determination of the Pareto front using minimal correction subsets
Guerreiro, A. P.; Cortes, J.; Vanderpooten, Daniel; … - In: Computers & operations research : and their … 153 (2023), pp. 1-16
Persistent link: https://www.econbiz.de/10014265760