default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHartmut Stadtler
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Hartmut Stadtler, Nikolai Heinrichs
:
Multi-period descriptive sampling for scenario generation applied to the stochastic capacitated lot-sizing problem. OR Spectr. 46(3): 639-668 (2024)
2010 – 2019
- 2019
- [j13]Hartmut Stadtler, Malte Meistering:
Model formulations for the capacitated lot-sizing problem with service-level constraints. OR Spectr. 41(4): 1025-1056 (2019) - 2015
- [j12]Martin Albrecht, Hartmut Stadtler:
Coordinating decentralized linear programs by exchange of primal information. Eur. J. Oper. Res. 247(3): 788-796 (2015) - 2013
- [j11]Hartmut Stadtler, Florian Sahling:
A lot-sizing and scheduling model for multi-stage flow lines with zero lead times. Eur. J. Oper. Res. 225(3): 404-419 (2013) - 2011
- [j10]Hartmut Stadtler:
Multi-level single machine lot-sizing and scheduling with zero lead times. Eur. J. Oper. Res. 209(3): 241-252 (2011) - [c2]Volker Windeck, Hartmut Stadtler:
A Liner Shipping Network Design - Routing and Scheduling Impacted by Environmental Influences. INOC 2011: 574-576 - 2010
- [j9]Carolin Püttmann, Hartmut Stadtler:
A collaborative planning approach for intermodal freight transportation. OR Spectr. 32(3): 809-830 (2010)
2000 – 2009
- 2009
- [j8]Hartmut Stadtler:
A framework for collaborative planning and state-of-the-art. OR Spectr. 31(1): 5-30 (2009) - 2008
- [j7]Meltem Denizel, Fatma Tevhide Altekin, Haldun Süral, Hartmut Stadtler:
Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times. OR Spectr. 30(4): 773-785 (2008) - 2007
- [j6]Hartmut Stadtler:
A general quantity discount and supplier selection mixed integer programming model. OR Spectr. 29(4): 723-744 (2007) - 2006
- [c1]Hartmut Stadtler:
Collaborative Planning - Concepts, Framework and Challenges. OR 2006: 129 - 2005
- [j5]Hartmut Stadtler, Ton G. de Kok, Herbert Meyr:
Editorial - in honour of Bernhard Fleischmann. Eur. J. Oper. Res. 163(3): 573-574 (2005) - [j4]Hartmut Stadtler:
Supply chain management and advanced planning--basics, overview and challenges. Eur. J. Oper. Res. 163(3): 575-588 (2005) - [j3]Gregor Dudek, Hartmut Stadtler:
Negotiation-based collaborative planning between supply chains partners. Eur. J. Oper. Res. 163(3): 668-687 (2005) - 2003
- [j2]Hartmut Stadtler:
Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows. Oper. Res. 51(3): 487-502 (2003) - [j1]Christopher Suerie, Hartmut Stadtler:
The Capacitated Lot-Sizing Problem with Linked Lot Sizes. Manag. Sci. 49(8): 1039-1054 (2003)
1980 – 1989
- 1983
- [b1]Hartmut Stadtler:
Interaktive Lösung schlecht-strukturierter Entscheidungsprobleme: Methoden u. Ergebnisse bei d. Stauung von Chemikalientankern. University of Hamburg, Germany, Minerva-Publikation 1983, ISBN 978-3-597-10402-3, pp. 1-252
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:
