Efficient presolving methods for solving maximal covering and partial set covering location problems (Q6168589): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2023.04.044 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q5241193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presolve Reductions in Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed Integer Programming: Analyzing 12 Years of Progress / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presolving in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fuzzy maximal covering location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on detecting simple redundancies in linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous maximal covering location problems with interconnected facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional facility location problems with continuous demand and a polygonal barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders decomposition for very large scale partial set covering and maximal covering location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network and Discrete Location: Models, Algorithms, and Applications, Second Edition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation effects in maximum covering models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spatial Optimization of Resources Deployment for Forest-Fire Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximal covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tighter formulation of the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean heuristic for the maximal covering location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress in presolving for mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-row and two-column mixed-integer presolve using hashing-based pairing methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale influence maximization via maximal covering location / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mean-shift algorithm for large-scale planar maximal covering location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using dual presolving reductions to reformulate cumulative constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Demand point aggregation method for covering problems with gradual coverage / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimal covering location and sizing problem in the presence of gradual cooperative coverage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An aggressive reduction scheme for the simple plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed Integer Programming Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Coverage Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intelligent-guided adaptive search for the maximum covering location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Linear Programming with Violations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut solver for the maximum stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the maximal covering location problem with heuristic concentration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New exact algorithms for planar maximum covering location by ellipses problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Location of Emergency Service Facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5524370 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2023.04.044 / rank
 
Normal rank

Latest revision as of 19:04, 30 December 2024

scientific article; zbMATH DE number 7709924
Language Label Description Also known as
English
Efficient presolving methods for solving maximal covering and partial set covering location problems
scientific article; zbMATH DE number 7709924

    Statements

    Efficient presolving methods for solving maximal covering and partial set covering location problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 July 2023
    0 references
    location
    0 references
    mixed integer programming
    0 references
    presolving methods
    0 references
    branch-and-cut
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers