Efficient presolving methods for solving maximal covering and partial set covering location problems
Year of publication: |
2023
|
---|---|
Authors: | Chen, Liang ; Chen, Sheng-Jie ; Chen, Wei-Kun ; Dai, Yu-Hong ; Quan, Tao ; Chen, Juan |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 311.2023, 1 (16.11.), p. 73-87
|
Subject: | Location | Mixed integer programming | Presolving methods | Banch-and-cut | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Betriebliche Standortwahl | Firm location choice | Standorttheorie | Location theory |
-
Körner, Mark-Christoph, (2014)
-
A mean-shift algorithm for large-scale planar maximal covering location problems
He, Zhou, (2016)
-
A fast algorithm for the rectilinear distance location problem
Nobakhtian, S., (2018)
- More ...
-
Benders decomposition for the large-scale probabilistic set covering problem
Liang, Jie, (2025)
-
Two-row and two-column mixed-integer presolve using hashing-based pairing methods
Gemander, Patrick, (2020)
-
FU, YUN-SHAN, (2010)
- More ...