default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTal Raviv
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j28]Edison Avraham, Tal Raviv
:
The data-driven time-dependent orienteering problem with soft time windows. EURO J. Transp. Logist. 12: 100112 (2023)- [j27]Tal Raviv, Yossi Bukchin, René de Koster:
Optimal Retrieval in Puzzle-Based Storage Systems Using Automated Mobile Robots. Transp. Sci. 57(2): 424-443 (2023) - 2022
- [j26]Lu Xing, Tal Raviv, Lina Sela:
Sensor placement for robust burst identification in water systems: Balancing modeling accuracy, parsimony, and uncertainties. Adv. Eng. Informatics 51: 101484 (2022) - [j25]Antoine Deza, Frédéric Meunier, Tal Raviv:
Preface: Optimization and Discrete Geometry. Discret. Optim. 44(Part): 100658 (2022) - [j24]Yifat Douek-Pinkovich, Irad Ben-Gal, Tal Raviv:
The stochastic test collection problem: Models, exact and heuristic solution approaches. Eur. J. Oper. Res. 299(3): 945-959 (2022) - [j23]Mor Kaspi, Tal Raviv, Marlin W. Ulmer:
Preface: Special issue on the future of city logistics and urban mobility. Networks 79(3): 251-252 (2022) - [j22]Mor Kaspi, Tal Raviv, Marlin W. Ulmer:
Directions for future research on urban mobility and city logistics. Networks 79(3): 253-263 (2022) - 2021
- [j21]Michal Penn, Tal Raviv:
Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs. J. Sched. 24(1): 83-102 (2021) - 2020
- [j20]Joachim Meyer, Omer Dembinsky, Tal Raviv:
Alerting about possible risks vs. blocking risky choices: A quantitative model and its empirical evaluation. Comput. Secur. 97: 101944 (2020) - [j19]Yossi Bukchin, Tal Raviv, Ilya Zaides:
The consecutive multiprocessor job scheduling problem. Eur. J. Oper. Res. 284(2): 427-438 (2020)
2010 – 2019
- 2019
- [j18]Ido Orenstein, Tal Raviv, Elad Sadan:
Flexible parcel delivery to automated parcel lockers: models, solution methods and analysis. EURO J. Transp. Logist. 8(5): 683-711 (2019) - [j17]Sharon Datner, Tal Raviv, Michal Tzur, Daniel Chemla:
Setting Inventory Levels in a Bike Sharing Network. Transp. Sci. 53(1): 62-76 (2019) - 2016
- [j16]Tal Raviv, Michal Tzur:
Introduction to the special issue on shared mobility systems. EURO J. Transp. Logist. 5(3): 257-259 (2016) - [j15]Mor Kaspi, Tal Raviv, Michal Tzur, Hila Galili:
Regulating vehicle sharing systems through parking reservation policies: Analysis and performance bounds. Eur. J. Oper. Res. 251(3): 969-987 (2016) - [j14]Zohar Postelnicu, Tal Raviv, Irad Ben-Gal:
Improving Websites' Quality of Service by Shortening Their Browsing Expected Path Length. Qual. Reliab. Eng. Int. 32(6): 2017-2031 (2016) - 2014
- [j13]Nicole Adler, Alfred Shalom Hakkert, Jonathan Kornbluth, Tal Raviv, Mali Sher:
Location-allocation models for traffic police patrol vehicles on an interurban network. Ann. Oper. Res. 221(1): 9-31 (2014) - [j12]Michael Masin, Tal Raviv:
Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem. J. Sched. 17(4): 321-338 (2014) - 2013
- [j11]Tal Raviv, Michal Tzur, Iris A. Forma:
Static repositioning in a bike-sharing system: models and solution approaches. EURO J. Transp. Logist. 2(3): 187-229 (2013) - [j10]Tal Raviv:
An efficient algorithm for maximizing the expected profit from a serial production line with inspection stations and rework. OR Spectr. 35(3): 609-638 (2013) - [j9]Mor Kaspi, Tal Raviv:
Service-Oriented Line Planning and Timetabling for Passenger Trains. Transp. Sci. 47(3): 295-311 (2013) - 2012
- [j8]Tal Raviv, Mor Kaspi:
The locomotive fleet fueling problem. Oper. Res. Lett. 40(1): 39-45 (2012) - [j7]Tal Raviv:
The battery switching station scheduling problem. Oper. Res. Lett. 40(6): 546-550 (2012) - 2010
- [j6]Daniel Granot, Frieda Granot, Tal Raviv:
On competitive sequential location in a network with a decreasing demand intensity. Eur. J. Oper. Res. 205(2): 301-312 (2010)
2000 – 2009
- 2009
- [j5]Michal Penn, Tal Raviv:
An algorithm for the maximum revenue jobshop problem. Eur. J. Oper. Res. 193(2): 437-450 (2009) - 2008
- [j4]Michal Penn, Tal Raviv:
A polynomial time algorithm for solving a quality control station configuration problem. Discret. Appl. Math. 156(4): 412-419 (2008) - 2007
- [j3]Wade D. Cook, Boaz Golany, Michal Penn, Tal Raviv:
Creating a consensus ranking of proposals from reviewers' partial ordinal rankings. Comput. Oper. Res. 34(4): 954-965 (2007) - 2005
- [j2]G. Alon, Dirk P. Kroese, Tal Raviv, Reuven Y. Rubinstein:
Application of the Cross-Entropy Method to the Buffer Allocation Problem in a Simulation-Based Environment. Ann. Oper. Res. 134(1): 137-151 (2005) - [j1]Wade D. Cook, Boaz Golany, Moshe Kress, Michal Penn, Tal Raviv:
Optimal Allocation of Proposals to Reviewers to Facilitate Effective Ranking. Manag. Sci. 51(4): 655-661 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
