Approximation algorithms for sequential batch‐testing of series...
ideas.repec.org
Rebi Daldal & Iftah Gamzu & Danny Segev & Tonguç Ünlüyurt, " Approximation algorithms for sequential batch‐testing of series systems," Naval Research ...
Danny Segev - The Mathematics Genealogy Projectwww.genealogy.math.ndsu.nodak.edu › ...
www.genealogy.math.ndsu.nodak.edu
Danny Segev. MathSciNet. Ph.D. Tel Aviv University Israel. Dissertation: Approximation Algorithms for NP-Hard Combinatorial Optimization Problems.
Near-optimal algorithms for the assortment planning problem ...www.econbiz.de › Record › near-optimal-algorit...
www.econbiz.de
... of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts), Danny Segev (Department of Statistics, University of Haifa, Haifa, Israel) ...
Algorithms - ESA 2006: 14th Annual European Symposium, Zurich,...
books.google.de
This book constitutes the refereed proceedings of the 14th Annual European Symposium on Algorithms, ESA 2006, held in Zurich, Switzerland, in the context of...
Algorithms -- ESA 2011: 19th Annual European Symposium, Saarbrücken,...
books.google.de
This book constitutes the refereed proceedings of the 19th Annual European Symposium on Algorithms, ESA 2011, held in Saarbrücken, Germany, in September
Algorithms and Data Structures: 9th International Workshop, WADS
books.google.de
This book constitutes the refereed proceedings of the 9th International Workshop on Algorithms and Data Structures, WADS 2005, held in Waterloo, Canada, in...
Greedy-Like Algorithms for Dynamic Assortment Planning Under...
papers.ssrn.com
We study the joint assortment planning and inventory management problem, where stock-out events elicit dynamic substitution effects, described by the Multinomia
Near-Optimal Algorithms for the Assortment Planning Problem Under...
papers.ssrn.com
Assortment planning of substitutable products is a major operational issue that arises in many industries, such as retailing, airlines and consumer electronics.
Approximation algorithms and hardness results for labeled...
link.springer.com
Authors; Authors and affiliations. Refael Hassin; Jérôme Monnot; Danny Segev Email author. Refael Hassin. 1. Jérôme Monnot. 2. Danny Segev. 1. Email author.
Approximation Algorithms and Hardness Results for Shortest Path Based...
link.springer.com
The graph orientation problem calls for orienting the edges of an undirected graph so as to maximize the number of pre-specified source-target vertex pairs...
Alle Infos zum Namen "Danny Segev"
Danny Segev's Homepage - Publications
sites.google.com
Algorithmica, 81(1): , Ali Aouad, Retsef Levi, and Danny Segev. Approximation algorithms for dynamic assortment optimization models. Mathematics ...
Missing: WKW Öblitz Verwaltungsgesellschaft mbH"
Approximation Algorithms for Orienting Mixed Graphs |...
www.springerprofessional.de
Graph orientation is a fundamental problem in graph theory that has recently arisen in the study of signaling-regulatory pathways in protein
14th Annual European Symposium on Algorithms - INFORMS
www.informs.org
The Institute for Operations Research and the Management Sciences
AFRL-AFOSR-VA-TR Bounded Error Approximation ...
www.dtic.mil
References. [1] Bugra Caskurlu, Vahan Mkrtchyan, Ojas Parekh and K. Subramani. On Bipartite Graphs, Trees and Their Partial. Vertex Covers. Submitted to ACM Transactions on Algorithms. [2] Vahan Mkrtchyan, Ojas Parekh, Danny Segev and K. Subramani. The Approximability of Partial Vertex Covers in.
CPM 2012: Helsinki, Finland
www.cs.ucr.edu
download paper; Dima Blokh, Danny Segev, Roded Sharan: Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations.
Approximation Algorithms and Hardness Results for Labeled ...www.springerprofessional.de › approximation-algorithms-and-hardne...
www.springerprofessional.de
Autoren: Refael Hassin, Jérôme Monnot, Danny Segev. Verlag: Springer Berlin Heidelberg. Erschienen in: Mathematical Foundations of Computer Science ...
CPM 2011: Palermo, Italy
www.cs.ucr.edu
download paper; Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan: Approximation Algorithms for Orienting Mixed Graphs download presentation (PDF) · download paper; Stephane Gosselin, Guillaume Damiand, Christine Solnon: Frequent Submap Discovery
Retsef Levi - MIT Personal Faculty
mitmgmtfaculty.mit.edu
Aouad, Ali, Vivek Farias, Retsef Levi, and Danny Segev. Operations Research. Forthcoming. “Approximation Algorithms for Dynamic Assortment Optimization ...
Students
www.tau.ac.il
Danny Segev Approximation algorithms for NP-hard problems in combinatorial optimization, Nili Guttmann-Beck Approximation algorithms for three ...
The Multi-radius Cover Problem | springerprofessional.de
www.springerprofessional.de
Authors: Refael Hassin, Danny Segev. Publisher: Springer Berlin Heidelberg. Published in: Algorithms and Data Structures. » Get access to the full-text. Let. G.
[PDF] Online Algorithms for Maximum Cardinality Matching with Edge...
www.semanticscholar.org
Nikhil R. Devanur, Kamal Jain, and Robert D. Kleinberg. Randomized primal-dual analysis of RANKING for online bipartite matching. In Proceedings of the 24th Annual ACM-SIAM. Symposium on Discrete Algorithms, pages 101–107, Leah Epstein, Asaf Levin, Danny Segev, and Oren Weimann. Improved bounds ...
Online Algorithms for Maximum Cardinality Matching DROPSdrops.dagstuhl.de › opus › volltexte
drops.dagstuhl.de
@InProceedings{buchbinder_et_al:LIPIcs:2017:7820, author = {Niv Buchbinder and Danny Segev and Yevgeny Tkach}, title = {{Online Algorithms for Maximum ...
Verwandte Suchanfragen zu Danny Segev
| Leah Epstein Anna Pagano |
Personen Vorname "Danny" (10424) Name "Segev" (30) |
sortiert nach Relevanz / Datum