A branch-and-bound algorithm for the exact optimal experimental design problem

Optimal Experimental Design

Computer Aided Chemical Engineering - 23rd European Symposium on Computer Aided Process Engineering ◽

Model based optimal experimental design - a semidefinite programming approach applied to a solvent design problem

10.1016/b978-0-444-63234-0.50131-7 ◽

2013 ◽

pp. 781-786 ◽

Cited By ~ 1

Author(s):

Belmiro P.M. Duarte ◽

Nuno M.C. Oliveira

Keyword(s):

Experimental Design ◽

Semidefinite Programming ◽

Design Problem ◽

Programming Approach ◽

Model Based ◽

Solvent Design

Branch and bound algorithm for a transfer line design problem: Stations with sequentially activated multi-spindle heads

European Journal of Operational Research ◽

10.1016/j.ejor.2008.03.028 ◽

2009 ◽

Vol 197 (3) ◽

pp. 1119-1132 ◽

Cited By ~ 29

Author(s):

A. Dolgui ◽

I. Ihnatsenka

Keyword(s):

Branch And Bound ◽

Design Problem ◽

Transfer Line ◽

Line Design

Proceedings of the International Conference on Operations Research and Enterprise Systems ◽

Accelerating the Performance of Parallel Depth-First-Search Branch-and-Bound Algorithm in Transportation Network Design Problem

10.5220/0005220103590366 ◽

2015 ◽

Author(s):

Amirali Zarrinmehr ◽

Yousef Shafahi

Keyword(s):

Network Design ◽

Branch And Bound ◽

Design Problem ◽

Transportation Network ◽

Network Design Problem ◽

Depth First Search

A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem

Transportation Science ◽

10.1287/trsc.34.4.364.12319 ◽

2000 ◽

Vol 34 (4) ◽

pp. 364-380 ◽

Cited By ~ 40

Author(s):

Klaus Büdenbender ◽

Tore Grünert ◽

Hans-Jürgen Sebastian

Keyword(s):

Tabu Search ◽

Network Design ◽

Branch And Bound ◽

Design Problem ◽

Network Design Problem ◽

Direct Flight

A Branch and Bound Algorithm for Bi-level Discrete Network Design Problem

Networks and Spatial Economics ◽

10.1007/s11067-012-9173-3 ◽

2012 ◽

Vol 13 (1) ◽

pp. 67-106 ◽

Cited By ~ 44

Author(s):

Hamid Farvaresh ◽

Mohammad Mehdi Sepehri

Keyword(s):

Network Design ◽

Branch And Bound ◽

Design Problem ◽

Network Design Problem ◽

Discrete Network Design Problem

A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach

Statistics and Computing ◽

10.1007/s11222-014-9476-y ◽

2014 ◽

Vol 25 (6) ◽

pp. 1113-1127 ◽

Cited By ~ 4

Author(s):

Selin Damla Ahipaşaoğlu

Keyword(s):

Experimental Design ◽

Mathematical Programming ◽

Design Problem ◽

Programming Approach ◽

First Order ◽

Mathematical Programming Approach ◽

Order Algorithm

Supplemental Material for Evidence Evaluation: Measure Z Corresponds to Human Utility Judgments Better Than Measure L and Optimal-Experimental-Design Models

Journal of Experimental Psychology Learning Memory and Cognition ◽

10.1037/a0035549.supp ◽

2014 ◽

Keyword(s):

Experimental Design ◽

Design Models ◽

Evidence Evaluation ◽

Evaluation Measure ◽

Better Than

Adaptive optimal experimental design for model discrimination

PsycEXTRA Dataset ◽

10.1037/e520592012-108 ◽

2010 ◽

Author(s):

Jay I. Myung ◽

Daniel R. Cavagnaro ◽

Mark A. Pitt

Keyword(s):

Experimental Design ◽

Model Discrimination

Optimal Experimental Design for Model Discrimination

PsycEXTRA Dataset ◽

10.1037/e527312012-124 ◽

2008 ◽

Author(s):

Jay I. Myung ◽

Mark A. Pitt

Keyword(s):

Experimental Design ◽

Model Discrimination

A Branch-and-Bound Algorithm for Multiple-Target Tracking and its Parallel Implementation

10.23919/acc.1988.4790020 ◽

1988 ◽

Author(s):

Cheng-Wu Chen ◽

Robert A. Walker ◽

Chin-Hu Feng

Keyword(s):

Target Tracking ◽

Branch And Bound ◽

Parallel Implementation ◽

Multiple Target Tracking ◽

Multiple Target