Preface |
|
Heteroscedastic Bayesian optimization using generalized product of experts |
|
A discrete competitive facility location model with proportional and binary rules sequentially applied |
|
Efficiency and effectiveness analysis based on educational inclusion and fairness of European countries |
|
Scalable Bayesian optimization with generalized product of experts |
|
Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule |
|
On MATLAB experience in accelerating DIRECT-GLce algorithm for constrained global optimization through dynamic data structures and parallelization |
|
Pooled testing with replication as a mass testing strategy for the COVID-19 pandemics |
|
Globally-biased BIRECT algorithm with local accelerators for expensive global optimization |
|
Solution of asymmetric discrete competitive facility location problems using ranking of candidate locations |
|
A Discrete Competitive Facility Location Model with Minimal Market Share Constraints and Equity-Based Ties Breaking Rule |
|
Penalty functions and two-step selection procedure based DIRECT-type algorithm for constrained global optimization |
|
Global optimization of grillage-type foundations using a distributed genetic algorithm |
|
Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants |
|
Improved scheme for selection of potentially optimal hyper-rectangles in DIRECT |
|
On the Accuracy of Some Absorbing Boundary Conditions for the Schrödinger Equation |
|
New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior |
|
Improving solution of discrete competitive facility location problems |
|
A preference-based multi-objective evolutionary algorithm R-NSGA-II with stochastic local search |
|
Application of Reduced-set Pareto-Lipschitzian Optimization to truss optimization |
|
HeteroPar 2014, APCIE 2014, and TASUS 2014 Special Issue |
|
A web-oriented software for the optimization of pooled experiments in NGS for detection of rare mutations Bioinformatics |
|
Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints |
|
Solution of Discrete Competitive Facility Location Problem for Firm Expansion |
|
Estimating the pareto front of a hard Bi-criterion competitive facility location problem |
|
Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems |
|
Parallel Optimization Algorithm for Competitive Facility Location |
|
Pareto-optimal front of cell formation problem in group technology |
|
Preface |
|
Globally-biased DISIMPL algorithm for expensive global optimization |
|
Simplicial Lipschitz optimization without the Lipschitz constant |
|
Application of multi-objective optimization to pooled experiments of next generation sequencing for detection of rare mutations |
|
Multi-objective single agent stochastic search in non-dominated sorting genetic algorithm |
|
Multi-objective optimization aided to allocation of vertices in aesthetic drawings of special graph |
|
A Parallel DISIMPL for Pile Placement Optimization in Grillage-Type Foundations |
|
Dynamic and hierarchical load-balancing techniques applied to parallel branch-and-bound methods |
|
Multimodal evolutionary algorithm for multidimensional scaling with city-block distances |
|
INFLUENCE OF LIPSCHITZ BOUNDS ON THE SPEED OF GLOBAL OPTIMIZATION |
|
Copositive Programming by Simplicial Partition |
|
OPTIMAL PLACEMENT OF PILES IN REAL GRILLAGES: EXPERIMENTAL COMPARISON OF OPTIMIZATION ALGORITHMS |
|
A Global Optimization Method Based on the Reduced Simplicial Statistical Model |
|
On probabilistic bounds inspired by interval arithmetic |
|
P-algorithm based on a simplicial statistical model of multimodal functions |
|
Interval Arithmetic Based Optimization in Nonlinear Regression |
|
Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds |
|
Multidimensional Scaling with City-Block Distances Based on Combinatorial Optimization and Systems of Linear Equations |
|
GLOBAL OPTIMIZATION USING THE BRANCH-AND-BOUND ALGORITHM WITH A COMBINATION OF LIPSCHITZ BOUNDS OVER SIMPLICES |
|
Branch and bound algorithm for multidimensional scaling with city-block metric |
|
Branch and bound with simplicial partitions for global optimization |
|
IMPROVED LIPSCHITZ BOUNDS WITH THE FIRST NORM FOR FUNCTION VALUES OVER MULTIDIMENSIONAL SIMPLEX |
|
A hybrid method for multidimensional scaling using city-block distances |
|
Parallel multidimensional scaling using grid computing: Assessment of performance |
|
On dimensionality of embedding space in multidimensional scaling |
|
Reducing of search space of multidimensional scaling problems with data exposing symmetries |
|
Analysis of different norms and corresponding Lipschitz constants for global optimization in multidimensional case |
|
Estimation of functional ranges using standard and inner interval arithmetic |
|
Parallel hybrid algorithm for global optimization of problems occurring in MDS-Based visualization |
|
Comparison of packages for interval arithmetic |
|
Template realization of generalized branch and bound algorithm |
|
On underestimating in interval computations |
|
Evaluation ranges of functions using balanced random interval arithmetic |
|
Global optimization based on a statistical model and simplicial partitioning |
|