Approximation Results Toward Nearest Neighbor Heuristic
Jérôme Monnot (2002)
The Yugoslav Journal of Operations Research
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A discrete approximation of the Weber problem with Euclidean distance”
Approximation Results Toward Nearest Neighbor Heuristic
On the conjecture relating minimax and minimean complexity norms
Peter Růžička, Juraj Wiedermann (1979)
Aplikace matematiky
Similarity:
Using counterexample it has been shown that an algorithm which is minimax optimal and over all minimax optimal algorithms is minimean optimal and has a uniform behaviour need not to be minimean optimal.
A new algorithm for the three counterfeit coins problem.
Bošnjak, Ivica (1998)
Novi Sad Journal of Mathematics
Similarity:
Erratum to the paper "On the Kaczmarz algorithm of approximation in infinite-dimensional spaces" (Studia Math. 148 (2001), 75-86)
Stanisław Kwapień, Jan Mycielski (2006)
Studia Mathematica
Similarity:
Analysis of an approximation algorithm for scheduling indepentent parallel tasks.
Li, Keqin (1999)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
A new algorithm for optimal solution of fixed charge transportation problem
Nermin Kartli, Erkan Bostanci, Mehmet Serdar Guzel (2023)
Kybernetika
Similarity:
Fixed charge transportation problem (FCTP) is a supply chain problem. In this problem, in addition to the cost per unit for each transported product, a fixed cost is also required. The aim is to carry out the transportation process at the lowest possible cost. As with all supply chain problems, this problem may have one, two, or three stages. An algorithm that can find the optimal solution for the problem in polynomial time is not known, even if it is a single-stage problem. For this...
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...