An exact algorithm for the capacitated facility location problems with single sourcing-Reference-Cited by-同舟云学术

An exact algorithm for the capacitated facility location problems with single sourcing

Published:1999-03 Issue:3 Volume:113 Page:544-559
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Holmberg Kaj,Rönnqvist Mikael,Yuan Di

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference23 articles.

1. Åhlander, F., 1994. The capacitated facility location problem with single sourcing, Master Thesis LiTH-MAT-EX-1994-07, Linköping University, Sweden (in Swedish)

2. Parallel savings based heuristics for the delivery problem;Altinkemer;Operations Research,1991

3. A heuristic Lagrangian algorithm for the capacitated plant location problem;Barcelo;European Journal of Operational Research,1984

4. Lagrangian heuristics for location problems;Beasley;European Journal of Operational Research,1993

5. CPLEX Optimization, Inc. (1994), Using the CPLEX Callable Library, version 3.0

Cited by 139 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An enhanced benders decomposition method and a matheuristic algorithm for solving the stochastic capacitated facility location problem with shortages;Expert Systems with Applications;2024-12

2. A congested facility location problem with strategic customers;European Journal of Operational Research;2024-10

3. Cooperative supply game and its revenue allocation method considering location of transportation hub;Kybernetes;2024-07-16

4. Solving the uncapacitated facility location problem under uncertainty: a hybrid tabu search with path-relinking simheuristic approach;Applied Intelligence;2024-04

5. A Lagrangian bounding and heuristic principle for bi-objective discrete optimization;Operational Research;2024-03-11