A new method for solving capacitated location problems based on a set partitioning approach

Computers and Operations Research

Volumn 29, Issue 4, 2002, Pages 365-386

  Baldacci, Roberto ^a   Hadjiconstantinou, Eleni ^a   Maniezzo, Vittorio ^b   Mingozzi, Aristide ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Capacitated p median; Dual heuristic solution; Facility location; Set partitioning problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; OPTIMIZATION; SET THEORY;

DISJOINT CLUSTERS;

PROBLEM SOLVING;

ALGORITHM;

EID: 0036526018     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(00)00072-1     Document Type: Article

References (24)

1. Efficient algorithms for the capacitated concentrator location problem
2. An algorithm for the fixed charge assigning users to sources problem
3. Weight constrained minimum sum-of-star clustering
4. Solving capacitated clustering problems
5. Capacitated clustering problems by hybrid simulated annealing and tabu search
6. A bionomic approach to the capacitated p-median problem
7. Cluster analysis and mathematical programming
8. An analysis of network location - Problems with distance constraints
9. The p-median problem with maximum distance constraints: A direct approach
10. Facility location on a tree with maximum distance constraints
11. Facility location with and without maximum distance constraints through the p-median problem
12. Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
13. Valid inequalities and facets of the capacitated plant location problem
14. A cross decomposition algorithm for capacitated facility location
15. An algorithm for solving large capacitated warehouse location problems
16. A set partitioning approach to the multiple depot vehicle scheduling problem
17. An exact method for the vehicle routing problem with backhauls
18. Using simulated annealing to solve routing and location problems
19. A set partitioning approach to the crew scheduling problem