default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichal Tzur
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j18]Gal Neria
, Michal Tzur:
The Dynamic Pickup and Allocation with Fairness Problem. Transp. Sci. 58(4): 821-840 (2024)- 2022
- [j17]Margaretha Gansterer, Richard F. Hartl, Michal Tzur:
Transportation in the Sharing Economy. Transp. Sci. 56(3): 567-570 (2022) - 2020
- [j16]Reut Noham, Michal Tzur:
Design and incentive decisions to increase cooperation in humanitarian relief networks. IISE Trans. 52(12): 1297-1311 (2020) - 2019
- [j15]Ohad Eisenhandler, Michal Tzur:
The Humanitarian Pickup and Distribution Problem. Oper. Res. 67(1): 10-32 (2019) - [j14]Sharon Datner, Tal Raviv, Michal Tzur, Daniel Chemla:
Setting Inventory Levels in a Bike Sharing Network. Transp. Sci. 53(1): 62-76 (2019) - [j13]Ohad Eisenhandler, Michal Tzur:
A Segment-Based Formulation and a Matheuristic for the Humanitarian Pickup and Distribution Problem. Transp. Sci. 53(5): 1389-1408 (2019) - 2018
- [j12]Reut Noham, Michal Tzur:
Designing humanitarian supply chains by incorporating actual post-disaster decisions. Eur. J. Oper. Res. 265(3): 1064-1077 (2018) - 2016
- [j11]Tal Raviv, Michal Tzur:
Introduction to the special issue on shared mobility systems. EURO J. Transp. Logist. 5(3): 257-259 (2016) - [j10]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) - 2013
- [j9]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) - 2011
- [j8]Michal Tzur, Ehud Drezner:
A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system. Eur. J. Oper. Res. 215(2): 325-336 (2011) - 2009
- [j7]Shoshana Anily, Michal Tzur, Laurence A. Wolsey:
Multi-item lot-sizing with joint set-up costs. Math. Program. 119(1): 79-94 (2009) - 2007
- [j6]Awi Federgruen, Joern Meissner, Michal Tzur:
Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems. Oper. Res. 55(3): 490-502 (2007) - 2006
- [j5]Peter Francis, Karen R. Smilowitz, Michal Tzur:
The Period Vehicle Routing Problem with Service Choice. Transp. Sci. 40(4): 439-454 (2006) - 2005
- [j4]Shoshana Anily, Michal Tzur:
Shipping Multiple Items by Capacitated Vehicles: An Optimal Dynamic Programming Approach. Transp. Sci. 39(2): 233-248 (2005) - 2000
- [j3]Barouch Matzliach, Michal Tzur:
Storage management of items in two levels of availability. Eur. J. Oper. Res. 121(2): 363-379 (2000) - 1994
- [j2]Awi Federgruen, Michal Tzur:
Minimal Forecast Horizons and a New Planning Procedure for the General Dynamic Lot Sizing Model: Nervousness Revisited. Oper. Res. 42(3): 456-468 (1994) - [j1]Awi Federgruen, Michal Tzur:
The Joint Replenishment Problem with Time-Varying Costs and Demands: Efficient, Asymptotic and ε-Optimal Solutions. Oper. Res. 42(6): 1067-1086 (1994)
Conference and Workshop Papers
- 2010
- [c1]Eran Hanany, Michal Tzur, Alon Levran:
The transshipment fund mechanism: coordinating the decentralized multi-location transshipment problem. BQGT 2010: 31:1
Informal and Other Publications
- 2024
- [i1]Gal Neria, Florentin D. Hildebrandt, Michal Tzur, Marlin W. Ulmer:
The Restaurant Meal Delivery Problem with Ghost Kitchens. CoRR abs/2408.07417 (2024)
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-09-25 01:39 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:
