Similar Search Results

Identifying preferred solutions to Multi-Objective Binary Optimisation problems, with an application to the Multi-Objective Knapsack Problem

Argyris, Nikolaos; Figueira, José; Morton, Alec - In: Journal of Global Optimization 49 (2011) 2, pp. 213-235

Persistent link: https://www.econbiz.de/10008925239

Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems

Mavrotas, George; Figueira, José; Antoniadis, Alexandros - In: Journal of Global Optimization 49 (2011) 4, pp. 589-606

Persistent link: https://www.econbiz.de/10008925253

An approximation algorithm for convex multi-objective programming problems

Ehrgott, Matthias; Shao, Lizhen; Schöbel, Anita - In: Journal of Global Optimization 50 (2011) 3, pp. 397-416

Persistent link: https://www.econbiz.de/10009149556

An objective space cut and bound algorithm for convex multiplicative programmes

Shao, Lizhen; Ehrgott, Matthias - In: Journal of Global Optimization 58 (2014) 4, pp. 711-728

Multiplicative programming problems are global optimisation problems known to be NP-hard. In this paper we propose an objective space cut and bound algorithm for approximately solving convex multiplicative programming problems. This method is based on an objective space approximation algorithm...

Persistent link: https://www.econbiz.de/10010896433

A dual variant of Benson’s “outer approximation algorithm” for multiple objective linear programming

Ehrgott, Matthias; Löhne, Andreas; Shao, Lizhen - In: Journal of Global Optimization 52 (2012) 4, pp. 757-778

Persistent link: https://www.econbiz.de/10010994025