default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAchim Koberstein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j17]Jana Ksciuk, Stefan Kuhlemann, Kevin Tierney
, Achim Koberstein:
Uncertainty in maritime ship routing and scheduling: A Literature review. Eur. J. Oper. Res. 308(2): 499-524 (2023)- [j16]Okan Dukkanci, Achim Koberstein, Bahar Yetis Kara:
Drones for relief logistics under uncertainty after an earthquake. Eur. J. Oper. Res. 310(1): 117-132 (2023) - 2022
- [j15]Pavlo Glushko, Csaba I. Fábián, Achim Koberstein:
An L-shaped method with strengthened lift-and-project cuts. Comput. Manag. Sci. 19(4): 539-565 (2022) - 2021
- [j14]Stefan Kuhlemann, Jana Ksciuk, Kevin Tierney, Achim Koberstein:
The stochastic liner shipping fleet repositioning problem with uncertain container demands and travel times. EURO J. Transp. Logist. 10: 100052 (2021) - [c9]Gregor Blossey, Gerd J. Hahn, Achim Koberstein:
Managing Uncertainty in Pharmaceutical Supply Chains: A Structured Review. HICSS 2021: 1-10 - 2020
- [j13]Christian Doppstadt, Achim Koberstein, Daniele Vigo:
The Hybrid Electric Vehicle - Traveling Salesman Problem with time windows. Eur. J. Oper. Res. 284(2): 675-692 (2020)
2010 – 2019
- 2019
- [j12]Altan Yalcin, Achim Koberstein, Kai-Oliver Schocke:
An optimal and a heuristic algorithm for the single-item retrieval problem in puzzle-based storage systems with multiple escorts. Int. J. Prod. Res. 57(1): 143-165 (2019) - [j11]Altan Yalcin, Achim Koberstein, Kai-Oliver Schocke:
Motion and layout planning in a grid-based early baggage storage system. OR Spectr. 41(3): 683-725 (2019) - 2016
- [j10]Christian Doppstadt, Achim Koberstein, Daniele Vigo:
The Hybrid Electric Vehicle - Traveling Salesman Problem. Eur. J. Oper. Res. 253(3): 825-842 (2016) - 2015
- [j9]Csaba I. Fábián, Christian Wolf, Achim Koberstein, Leena Suhl:
Risk-Averse Optimization in Two-Stage Stochastic Models: Computational Aspects and a Study. SIAM J. Optim. 25(1): 28-52 (2015) - 2014
- [j8]Christian Wolf, Csaba I. Fábián, Achim Koberstein, Leena Suhl:
Applying oracles of on-demand accuracy in two-stage stochastic programming - A computational study. Eur. J. Oper. Res. 239(2): 437-448 (2014) - 2013
- [j7]Christian Wolf, Achim Koberstein:
Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method. Eur. J. Oper. Res. 230(1): 143-156 (2013) - [j6]Tim Schöneberg, Achim Koberstein, Leena Suhl:
A stochastic programming approach to determine robust delivery profiles in area forwarding inbound logistics networks. OR Spectr. 35(4): 807-834 (2013) - 2012
- [j5]Stefan Guericke, Achim Koberstein, Frank Schwartz, Stefan Voß:
A stochastic model for the implementation of postponement strategies in global distribution networks. Decis. Support Syst. 53(2): 294-305 (2012) - 2011
- [j4]Franz Wesselmann, Achim Koberstein, Uwe H. Suhl:
Pivot-and-reduce cuts: An approach for improving Gomory mixed-integer cuts. Eur. J. Oper. Res. 214(1): 15-26 (2011) - [c8]Stefan Guericke, Achim Koberstein, Frank Schwartz, Stefan Voß:
A Stochastic Model for Implementing Postponement Strategies in Distribution Networks. HICSS 2011: 1-10 - [c7]Kai Wittek, Achim Koberstein, Thomas Spengler:
Mid-Term Model-Plant Allocation for Flexible Production Networks in the Automotive Industry. OR 2011: 433-438 - 2010
- [c6]Jens Peter Kempkes, Achim Koberstein, Leena Suhl:
A Resource Based Mixed Integer Modelling Approach for Integrated Operational Logistics Planning. Heinz Nixdorf Symposium 2010: 281-294 - [c5]Kostja Siefen, Leena Suhl, Achim Koberstein:
A New Model Approach on Cost-Optimal Charging Infrastructure for Electric-Drive Vehicle Fleets. OR 2010: 233-238 - [c4]Christian Wolf, Achim Koberstein, Tim Hultberg:
Stochastic Extensions to FlopC++. OR 2010: 333-338 - [c3]Atilla Yalçin, Achim Koberstein:
Optimising Procurement Portfolios to Mitigate Risk in Supply Chains. OR 2010: 459-464
2000 – 2009
- 2009
- [j3]Ralf Bihlmaier, Achim Koberstein, René Obst:
Modeling and optimizing of strategic and tactical production planning in the automotive industry under uncertainty. OR Spectr. 31(2): 311 (2009) - [c2]Achim Koberstein, Ralf Bihlmaier, René Obst, Leena Suhl:
Ein Optimierungssystem für die strategische Produktions- und Kapazitätsplanung in der Automobilindustrie. Wirtschaftsinformatik (2) 2009: 87-98 - 2008
- [j2]Achim Koberstein:
Progress in the dual simplex algorithm for solving large scale LP problems: techniques for a fast and stable implementation. Comput. Optim. Appl. 41(2): 185-204 (2008) - 2007
- [j1]Achim Koberstein, Uwe H. Suhl:
Progress in the dual simplex method for large scale LP problems: practical dual phase 1 algorithms. Comput. Optim. Appl. 37(1): 49-65 (2007) - 2005
- [b1]Achim Koberstein:
The dual simplex method, techniques for a fast and stable implementation. Paderborn University, Germany, 2005 - 2002
- [c1]Meinolf Sellmann, Georg Kliewer, Achim Koberstein:
Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design. ESA 2002: 845-858
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-04-24 23:03 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:
