default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Klose
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j15]Tue Rauff Lind Christensen, Andreas Klose
:
A fast exact method for the capacitated facility location problem with differentiable convex production costs. Eur. J. Oper. Res. 292(3): 855-868 (2021)
2010 – 2019
- 2018
- [j14]Sune Lauth Gadegaard, Andreas Klose, Lars Relund Nielsen:
A bi-objective approach to discrete cost-bottleneck location problems. Ann. Oper. Res. 267(1-2): 179-201 (2018) - [j13]Sune Lauth Gadegaard, Andreas Klose, Lars Relund Nielsen:
An improved cut-and-solve algorithm for the single-source capacitated facility location problem. EURO J. Comput. Optim. 6(1): 1-27 (2018) - 2016
- [j12]Kurt Jörnsten, Andreas Klose:
An improved Lagrangian relaxation and dual ascent approach to facility location problems. Comput. Manag. Sci. 13(3): 317-348 (2016) - 2013
- [j11]Tue Rauff Lind Christensen, Kim Allan Andersen, Andreas Klose:
Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming. Transp. Sci. 47(3): 428-438 (2013) - 2012
- [j10]Marcel Turkensteen, Andreas Klose:
Demand dispersion and logistics costs in one-to-many distribution systems. Eur. J. Oper. Res. 223(2): 499-507 (2012) - [j9]Simon Görtz, Andreas Klose:
A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem. INFORMS J. Comput. 24(4): 597-610 (2012)
2000 – 2009
- 2009
- [j8]Simon Görtz, Andreas Klose:
Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem. J. Heuristics 15(4): 331-349 (2009) - 2008
- [j7]Andreas Klose:
Algorithms for solving the single-sink fixed-charge transportation problem. Comput. Oper. Res. 35(6): 2079-2092 (2008) - 2007
- [j6]Andreas Klose, Simon Görtz:
A branch-and-price algorithm for the capacitated facility location problem. Eur. J. Oper. Res. 179(3): 1109-1125 (2007) - 2005
- [j5]Andreas Klose, Andreas Drexl:
Facility location models for distribution system design. Eur. J. Oper. Res. 162(1): 4-29 (2005) - [j4]Andreas Klose, Andreas Drexl:
Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation. Manag. Sci. 51(11): 1689-1705 (2005) - 2000
- [j3]Andreas Klose:
A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem. Eur. J. Oper. Res. 126(2): 408-421 (2000) - [j2]Arno Bruns, Andreas Klose, Paul Staehly:
Restructuring of Swiss parcel delivery services. OR Spectr. 22(2): 285-302 (2000)
1990 – 1999
- 1999
- [j1]Andreas Klose:
An LP-based heuristic for two-stage capacitated facility location problems. J. Oper. Res. Soc. 50(2): 157-166 (1999)
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:08 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:
