Andreas Klose

Orcid: 0000-0003-4543-8316

According to our database1, Andreas Klose authored at least 15 papers between 1999 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
A fast exact method for the capacitated facility location problem with differentiable convex production costs.
Eur. J. Oper. Res., 2021

2018
An improved cut-and-solve algorithm for the single-source capacitated facility location problem.
EURO J. Comput. Optim., 2018

A bi-objective approach to discrete cost-bottleneck location problems.
Ann. Oper. Res., 2018

2016
An improved Lagrangian relaxation and dual ascent approach to facility location problems.
Comput. Manag. Sci., 2016

2013
Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming.
Transp. Sci., 2013

2012
A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem.
INFORMS J. Comput., 2012

Demand dispersion and logistics costs in one-to-many distribution systems.
Eur. J. Oper. Res., 2012

2009
Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem.
J. Heuristics, 2009

2008
Algorithms for solving the single-sink fixed-charge transportation problem.
Comput. Oper. Res., 2008

2007
A branch-and-price algorithm for the capacitated facility location problem.
Eur. J. Oper. Res., 2007

2005
Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation.
Manag. Sci., 2005

Facility location models for distribution system design.
Eur. J. Oper. Res., 2005

2000
Restructuring of Swiss parcel delivery services.
OR Spectr., 2000

A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem.
Eur. J. Oper. Res., 2000

1999
An LP-based heuristic for two-stage capacitated facility location problems.
J. Oper. Res. Soc., 1999


  Loading...