A new algorithm for the three counterfeit coins problem.
Bošnjak, Ivica (1998)
Novi Sad Journal of Mathematics
Similarity:
Displaying similar documents to “On the conjecture relating minimax and minimean complexity norms”
A new algorithm for the three counterfeit coins problem.
The extent to which linear problems have linear optimal algorithms
Edward W. Packel (1988)
Banach Center Publications
Similarity:
The Benders method and parametrization of the right-hand sides in the mixed integer linear programming problem
Jaroslav Hrouda (1976)
Aplikace matematiky
Similarity:
Optimal placement of electrodes in an electroporation process
Nicolae Cîndea, Benoît Fabrèges, Frédéric de Gournay, Clair Poignard (2010)
ESAIM: Proceedings
Similarity:
Electroporation consists in increasing the permeability of a tissue by applying high voltage pulses. In this paper we discuss the question of optimal placement and optimal loading of electrodes such that electroporation holds only in a given open set of the domain. The electroporated set of the domain is where the norm of the electric field is above a given threshold value. We use a standard gradient algorithm to optimize the loading...
Finding an ε-optimal regression subset
A. Bartkowiak (1991)
Applicationes Mathematicae
Similarity:
A conception of optimality for algorithms and its application to the optimal search for a minimum
A. Adamski, A. Korytowski, W. Mitkowski (1977)
Applicationes Mathematicae
Similarity:
Managing cost uncertainties in transportation and assignment problems.
Adlakha, V., Arsham, H. (1998)
Journal of Applied Mathematics and Decision Sciences
Similarity:
A heuristic algorithm for the flowshop scheduling problem
Jatinder N. D. Gupta (1976)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem
Maric, Miroslav (2013)
Serdica Journal of Computing
Similarity:
In this paper a Variable Neighborhood Search (VNS) algorithm for solving the Capacitated Single Allocation Hub Location Problem (CSAHLP) is presented. CSAHLP consists of two subproblems; the first is choosing a set of hubs from all nodes in a network, while the other comprises finding the optimal allocation of non-hubs to hubs when a set of hubs is already known. The VNS algorithm was used for the first subproblem, while the CPLEX solver was used for the second. Computational results...