Lagrangean heuristics for location problems-Reference-Cited by-同舟云学术

Lagrangean heuristics for location problems

Published:1993-03 Issue:3 Volume:65 Page:383-399
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Beasley J.E.

Publisher

Elsevier BV

Subject

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

Reference57 articles.

1. Facility location models for distribution planning;Aikens;European Journal of Operational Research,1985

2. Probabilistic analysis of a relaxation for the k-median problem;Ahn;Mathematics of Operations Research,1988

3. Linear relaxations of the capacitated warehouse location problem;Baker;Journal of the Operational Research Society,1982

4. A partial dual algorithm for the capacitated warehouse location problem;Baker;European Journal of Operational Research,1986

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

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

1. oBABC: A one-dimensional binary artificial bee colony algorithm for binary optimization;Swarm and Evolutionary Computation;2024-06

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

3. Facility Location: A Guide to Modeling and Solving Complex Problem Variants via Lagrangian Relaxation Heuristics;International Series in Operations Research & Management Science;2024

4. The balanced p-median problem with unitary demand;Computers & Operations Research;2023-07

5. Matheuristics: survey and synthesis;International Transactions in Operational Research;2023-04-15