On some variants of Euclidean k-supplier

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Operations research letters
1. Verfasser: Lee, Euiwoong (VerfasserIn)
Weitere Verfasser: Nagarajan, Viswanath (VerfasserIn), Wang, Lily (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2022
Schlagworte:
Approximation algorithms > Clustering > Euclidean spaces > Hardness of approximation > k-center > Outliers > Aufsatz in Zeitschrift
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands 2023 Fukasawa, Ricardo
Powers of commutators 2023 Lenstra, H. W.
Combined pricing and inventory control with multiple unreliable suppliers 2023 Federgruen, Awi
A knapsack intersection hierarchy 2023 Jozefiak, Adam
A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming 2023 Mefo Kue, Floriane
SPT optimality (mostly) via linear programming 2023 Cho, Woo-Hyung
A generalized Nash equilibrium problem arising in banking regulation : an existence result with Tarski's theorem 2023 Braouezec, Yann
Probability bounds for n random events under (n-1)-wise independence 2023 Natarajan, Karthik
Instability of LRTF multiclass queueing networks 2023 Kruk, Łukas
A note on the quickest minimum cost transshipment problem 2023 Skutella, Martin
Service staffing with delay probabilities 2023 Turpin, Lonnie
First-break-heuristically-schedule : constructing highly-constrained sports timetables 2023 Van Bulck, David
Dual sourcing systems : an asymptotic result for the cost of optimal tailored base-surge (TBS) policy 2023 Devalkar, Sripad K.
Asymptotics for the Laplace transform of the time integral of the geometric Brownian motion 2023 Pirjol, Dan
Generalized ordinal Nash games : variational approach 2023 Bueno, Orestes
Contractivity of Bellman operator in risk averse dynamic programming with infinite horizon 2023 Kopa, Miloš
On the strength of recursive McCormick relaxations for binary polynomial optimization 2023 Khajavirad, Aida
On balanced games with infinitely many players : revisiting Schmeidler's result 2023 Bartl, David
Scoring indices, top-truncated preferences, and splitting invariance 2023 Kong, Qianqian
Ellipsoidal classification via semidefinite programming 2023 Astorino, Annabella
Alle Artikel auflisten