default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnders Thorstenson
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j10]Qiuping Ma, Hongyan Li
, Anders Thorstenson:
A big data-driven root cause analysis system: Application of Machine Learning in quality problem solving. Comput. Ind. Eng. 160: 107580 (2021)- [j9]Ata Jalili Marand, Hongyan Li, Anders Thorstenson:
Competing on price, speed, and reliability: How does bounded rationality matter? J. Oper. Res. Soc. 72(9): 2059-2072 (2021)
2010 – 2019
- 2018
- [j8]Yongsheng Cheng, Hongyan Li, Anders Thorstenson:
Advance selling with double marketing efforts in a newsvendor framework. Comput. Ind. Eng. 118: 352-365 (2018) - [j7]Viktoryia Buhayenko, Sin C. Ho, Anders Thorstenson:
A variable neighborhood search heuristic for supply chain coordination using dynamic price discounts. EURO J. Transp. Logist. 7(4): 363-385 (2018) - [j6]Agus Darmawan, Hartanto Wong, Anders Thorstenson:
Integration of promotion and production decisions in sales and operations planning. Int. J. Prod. Res. 56(12): 4186-4206 (2018) - [c1]Anders Thorstenson:
As Simple as Possible but no Simpler-An Inquiry into Approximations for a Re-order Point Inventory Control Model with Gamma-distributed Demand. IEEM 2018: 153-157 - 2015
- [j5]Soheil Abginehchi, Christian Larsen, Anders Thorstenson:
Exploring the economic consequences of letting a supplier hold reserve storage. Comput. Oper. Res. 53: 223-233 (2015) - 2014
- [j4]Mohsen S. Sajadieh, Anders Thorstenson:
Comparing sourcing strategies in two-echelon supply chains. Comput. Oper. Res. 45: 108-115 (2014)
2000 – 2009
- 2008
- [j3]Sigrid Lise Nonås, Anders Thorstenson:
Solving a combined cutting-stock and lot-sizing problem with a column generating procedure. Comput. Oper. Res. 35(10): 3371-3392 (2008) - [j2]Christian Larsen, Anders Thorstenson:
A comparison between the order and the volume fill rate for a base-stock inventory control system under a compound renewal demand process. J. Oper. Res. Soc. 59(6): 798-804 (2008) - 2000
- [j1]Sigrid Lise Nonås, Anders Thorstenson:
A combined cutting-stock and lot-sizing problem. Eur. J. Oper. Res. 120(2): 327-342 (2000)
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-07 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:
