Klose Andreas

Andreas Klose

Information about the author Andreas Klose will soon be added to the site.
Found 8 papers in total
Solving the Single‐Sink, Fixed‐Charge, Multiple‐Choice Transportation Problem by Dynamic Programming
Solving the Single‐Sink, Fixed‐Charge, Multiple‐Choice Transportation Problem by Dynamic Programming
2013
This paper considers a minimum‐cost network flow problem in a bipartite graph...
A Simple but Usually Fast Branch‐and‐Bound Algorithm for the Capacitated Facility Location Problem
A Simple but Usually Fast Branch‐and‐Bound Algorithm for the Capacitated Facility Location Problem
2012
This paper presents a simple branch‐and‐bound method based on Lagrangean...
Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem
Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem
2009
The single-sink fixed-charge transportation problem (SSFCTP) consists of finding a...
A branch-and-price algorithm for the capacitated facility location problem
A branch-and-price algorithm for the capacitated facility location problem
2007
The capacitated facility location problem is a well-known combinatorial optimization...
Lower bounds for the capacitated facility location problem based on column generation
Lower bounds for the capacitated facility location problem based on column generation
2005
The capacitated facility location problem (CFLP) is a well-known combinatorial...
Facility location models for distribution system design
Facility location models for distribution system design
2005
The design of the distribution system is a strategic issue for almost every company....
A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem
A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem
2000
The two-stage capacitated facility location problem is to find the optimal locations...
A branch and bound algorithm for an uncapacitated facility location problem with a side constraint
A branch and bound algorithm for an uncapacitated facility location problem with a side constraint
1998
In this paper, a branch and bound algorithm for solving an uncapacitated facility...
Papers per page: