A scaleable projection‐based branch‐and‐cut algorithm for the p‐center problem-Reference-Cited by-同舟云学术

A scaleable projection‐based branch‐and‐cut algorithm for the p‐center problem

Published:2022-11 Issue:1 Volume:303 Page:78-98
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Gaar Elisabeth^ORCID,Sinnl Markus^ORCID

Publisher

Elsevier BV

Subject

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

Reference29 articles.

1. Enhancements to two exact algorithms for solving the vertex p-center problem;Al-Khedhairi;Journal of Mathematical Modelling and Algorithms,2005

2. Dominant, an algorithm for the p-center problem;Caruso;European Journal of Operational Research,2003

3. P-center problems;Çalık,2019

4. Double bound method for solving the p-center location problem;Çalık;Computers & Operations Research,2013

5. New relaxation-based algorithms for the optimal solution of the continuous and discrete p-center problems;Chen;Computers & Operations Research,2009

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

1. Benders decomposition for the discrete ordered median problem;European Journal of Operational Research;2024-09

2. Three network design problems for community energy storage;Networks;2024-07-17

3. New formulations for two location problems with interconnected facilities;European Journal of Operational Research;2024-04

4. Robust Facility Location;International Series in Operations Research & Management Science;2024

5. Discrete Facility Location Problems;International Series in Operations Research & Management Science;2024