Enhancement of sandwich algorithms for approximating higher-dimensional convex Pareto sets
Year of publication: |
2011
|
---|---|
Authors: | Rennen, Gijs ; Dam, Edwin Robert van ; Hertog, Dirk den |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 23.2011, 4, p. 493-517
|
Subject: | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
-
A polyhedral description of kernels
Chen, Qin, (2016)
-
On the query complexity of Black-Peg AB-mastermind
Ouali, Mourad el, (2018)
- More ...
-
Space-filling Latin hypercube designs for computer experiments
Husslage, Bart, (2008)
-
Enhancement of sandwich algorithms for approximating higher dimensional convex pareto sets
Rennen, Gijs, (2009)
-
Space-filling Latin hypercube designs for computer experiments
Husslage, Bart, (2006)
- More ...