A comparison of two dual-based procedures for solving the p-median problem-Reference-Cited by-同舟云学术

A comparison of two dual-based procedures for solving the p-median problem

Published:1985-06 Issue:3 Volume:20 Page:387-396
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Hanjoul Pierre,Peeters Dominique

Publisher

Elsevier BV

Subject

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

Reference38 articles.

1. A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality;Bazaraa;European Journal of Operational Research,1979

2. On the choice of step size in subgradient optimization;Bazaraa;European Journal of Operational Research,1981

3. A tree search algorithm for the p-median problem;Christofides;European Journal of Operational Research,1982

4. Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms;Cornuejols;Management Science,1977

5. Some facets of the simple plant location polytope;Cornuejols,1981

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

1. The dynamic p-median problem with mobile facilities;Computers & Industrial Engineering;2019-09

2. On solving the multiple p-median problem based on biclustering;Operational Research;2019-02-13

3. Partitioning methods for pruning the Pareto set with application to multiobjective allocation of a cross-trained workforce;Computers & Industrial Engineering;2017-09

4. An improved Lagrangian relaxation and dual ascent approach to facility location problems;Computational Management Science;2015-10-27

5. Standortmanagement;Strategisches und operatives Logistikmanagement: Distribution;2015-10-15