Search alternatives:
optimisation algorithm » optimization algorithms (Expand Search), maximization algorithm (Expand Search), identification algorithm (Expand Search)
process optimisation » process optimization (Expand Search), robust optimisation (Expand Search), process simulation (Expand Search)
model optimization » codon optimization (Expand Search), global optimization (Expand Search), based optimization (Expand Search)
data process » data processing (Expand Search), damage process (Expand Search), data access (Expand Search)
binary fast » binary mask (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
fast model » first model (Expand Search), rat model (Expand Search), best model (Expand Search)
optimisation algorithm » optimization algorithms (Expand Search), maximization algorithm (Expand Search), identification algorithm (Expand Search)
process optimisation » process optimization (Expand Search), robust optimisation (Expand Search), process simulation (Expand Search)
model optimization » codon optimization (Expand Search), global optimization (Expand Search), based optimization (Expand Search)
data process » data processing (Expand Search), damage process (Expand Search), data access (Expand Search)
binary fast » binary mask (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
fast model » first model (Expand Search), rat model (Expand Search), best model (Expand Search)
-
1
-
2
-
3
-
4
Scheduling method for pairing night-shift and morning-shift duties on metro lines with complex structure
Published 2022“…To improve the rest time of crews, this paper proposes a binary programming model to optimise the NMDPP. Moreover, a hybrid algorithm combining General Variable Neighbourhood Search (GVNS) with an Assignment Algorithm is designed to find high-quality solutions for this problem. …”
-
5
Bayesian sequential design for sensitivity experiments with hybrid responses
Published 2023“…To deal with the problem of complex computation involved in searching for optimal designs, fast algorithms are presented using two strategies to approximate the optimal criterion, denoted as SI-optimal design and Bayesian D-optimal design, respectively. …”