Dakota, a multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis: version 6.13 …
The Dakota toolkit provides a flexible and extensible interface between simulation codes
and iterative analysis methods. Dakota contains algorithms for optimization with gradient …
and iterative analysis methods. Dakota contains algorithms for optimization with gradient …
Sensor placement in municipal water networks
We present a model for optimizing the placement of sensors in municipal water networks to
detect maliciously injected contaminants. An optimal sensor configuration minimizes the …
detect maliciously injected contaminants. An optimal sensor configuration minimizes the …
DAKOTA: a multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis. Version 5.0 …
MS Eldred, KR Dalbey, WJ Bohnhoff, BM Adams… - 2010 - osti.gov
The DAKOTA (Design Analysis Kit for Optimization and Terascale Applications) toolkit
provides a flexible and extensible interface between simulation codes and iterative analysis …
provides a flexible and extensible interface between simulation codes and iterative analysis …
Generalized field-development optimization with derivative-free procedures
OJ Isebor, DE Ciaurri, LJ Durlofsky - Spe Journal, 2014 - onepetro.org
The optimization of general oilfield development problems is considered. Techniques are
presented to simultaneously determine the optimal number and type of new wells, the …
presented to simultaneously determine the optimal number and type of new wells, the …
MALLBA: A library of skeletons for combinatorial optimisation
The mallba project tackles the resolution of combinatorial optimization problems using
algorithmic skeletons implemented in C++. mallba offers three families of generic resolution …
algorithmic skeletons implemented in C++. mallba offers three families of generic resolution …
Solution of a min-max vehicle routing problem
We use a branch-and-cut search to solve the Whizzkids' 96 vehicle routing problem,
demonstrating that the winning solution in the 1996 competition is in fact optimal. Our …
demonstrating that the winning solution in the 1996 competition is in fact optimal. Our …
Parallel Branch‐and‐Bound Algorithms
TG Crainic, B Le Cun… - Parallel combinatorial …, 2006 - Wiley Online Library
In the beginning of the twenty-first century, large unsolved combinatorial optimization
problems have been solved exactly. Two impressive cases should be mentioned. First are …
problems have been solved exactly. Two impressive cases should be mentioned. First are …
MALLBA: a software library to design efficient optimisation algorithms
In this paper we discuss on the MALLBA framework, a software tool for the resolution of
combinatorial optimisation problems using generic algorithmic skeletons implemented in …
combinatorial optimisation problems using generic algorithmic skeletons implemented in …
Parallel branch and cut for capacitated vehicle routing
TK Ralphs - Parallel Computing, 2003 - Elsevier
Combinatorial optimization problems arise commonly in logistics applications. The most
successful approaches to date for solving such problems involve modeling them as integer …
successful approaches to date for solving such problems involve modeling them as integer …
Hedging uncertainty: Approximation algorithms for stochastic optimization problems
We study the design of approximation algorithms for stochastic combinatorial optimization
problems. We formulate the problems in the framework of two-stage stochastic optimization …
problems. We formulate the problems in the framework of two-stage stochastic optimization …