default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDorothée Honhon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Jan C. Fransoo
, Dorothée Honhon:
Call for Papers: Manufacturing & Service Operations Management Special Issue on Responsible Retail Operations. Manuf. Serv. Oper. Manag. 26(5): 1978-1979 (2024)- 2022
- [j15]Arzum Akkas, Dorothée Honhon:
Shipment Policies for Products with Fixed Shelf Lives: Impact on Profits and Waste. Manuf. Serv. Oper. Manag. 24(3): 1611-1629 (2022) - 2021
- [j14]Alexander H. Hübner, Pedro Amorim, Jan Fransoo, Dorothée Honhon, Heinrich Kuhn, Víctor Martínez-de-Albéniz, David Robb:
Digitalization and omnichannel retailing: Innovative OR approaches for retail operations. Eur. J. Oper. Res. 294(3): 817-819 (2021) - [j13]Jiwen Ge, Dorothée Honhon, Jan C. Fransoo, Lei Zhao:
Supplying to Mom and Pop: Traditional Retail Channel Selection in Megacities. Manuf. Serv. Oper. Manag. 23(1): 19-35 (2021) - 2020
- [j12]Jiwen Ge, Dorothée Honhon, Jan C. Fransoo, Lei Zhao:
Manufacturer competition in the nanostore retail channel. Eur. J. Oper. Res. 286(1): 360-374 (2020) - [j11]Dorothée Honhon, Kyle Hyndman:
Flexibility and Reputation in Repeated Prisoner's Dilemma Games. Manag. Sci. 66(11): 4998-5014 (2020) - [j10]Kyle Hyndman, Dorothée Honhon:
Flexibility in Long-Term Relationships: An Experimental Study. Manuf. Serv. Oper. Manag. 22(2): 273-291 (2020) - [j9]Dorothée Honhon, Xiajun Amy Pan, Sreelata Jonnalagedda:
In-Out Algorithm for assortment planning under a ranking-based consumer choice model. Oper. Res. Lett. 48(3): 309-316 (2020)
2010 – 2019
- 2018
- [j8]Anna Franceschetti, Dorothée Honhon, Gilbert Laporte, Tom Van Woensel:
A Shortest-Path Algorithm for the Departure Time and Speed Optimization Problem. Transp. Sci. 52(4): 756-768 (2018) - 2017
- [j7]Anna Franceschetti, Emrah Demir, Dorothée Honhon, Tom Van Woensel, Gilbert Laporte, Mark Stobbe:
A metaheuristic for the time-dependent pollution-routing problem. Eur. J. Oper. Res. 259(3): 972-991 (2017) - 2014
- [j6]J. C. F. Ehrenthal, Dorothée Honhon, Tom Van Woensel:
Demand seasonality in retail inventory management. Eur. J. Oper. Res. 238(2): 527-539 (2014) - 2013
- [j5]Dorothée Honhon, Sridhar Seshadri:
Fixed vs. Random Proportions Demand Models for the Assortment Planning Problem Under Stockout-Based Substitution. Manuf. Serv. Oper. Manag. 15(3): 378-386 (2013) - 2012
- [j4]Canan Ulu, Dorothée Honhon, Aydin Alptekinoglu:
Learning Consumer Tastes Through Dynamic Assortments. Oper. Res. 60(4): 833-849 (2012) - [j3]Dorothée Honhon, Sreelata Jonnalagedda, Xiajun Amy Pan:
Optimal Algorithms for Assortment Selection Under Ranking-Based Consumer Choice Models. Manuf. Serv. Oper. Manag. 14(2): 279-289 (2012) - 2010
- [j2]Dorothée Honhon, Vishal Gaur, Sridhar Seshadri:
Assortment Planning and Inventory Decisions Under Stockout-Based Substitution. Oper. Res. 58(5): 1364-1379 (2010)
2000 – 2009
- 2006
- [j1]Vishal Gaur, Dorothée Honhon:
Assortment Planning and Inventory Decisions Under a Locational Choice Model. Manag. Sci. 52(10): 1528-1543 (2006)
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-10-23 21:27 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:
