Pages that link to "Item:Q4883162"
From MaRDI portal
The following pages link to An exact algorithm for the maximal covering problem (Q4883162):
Displaying 28 items.
- A mean-shift algorithm for large-scale planar maximal covering location problems (Q322404) (← links)
- A hybrid method for the probabilistic maximal covering location-allocation problem (Q337483) (← links)
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- A mixed integer linear program and tabu search approach for the complementary edge covering problem (Q964367) (← links)
- Bayesian coverage optimization models (Q965815) (← links)
- Fuzzy logic based algorithms for maximum covering location problems (Q1007856) (← links)
- A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem (Q1577777) (← links)
- A VNS-LP algorithm for the robust dynamic maximal covering location problem (Q1642060) (← links)
- Intelligent-guided adaptive search for the maximum covering location problem (Q1652063) (← links)
- Benders decomposition for very large scale partial set covering and maximal covering location problems (Q1719620) (← links)
- On the overlap area of a disk and a piecewise circular domain (Q1725599) (← links)
- A constructive proof of swap local search worst-case instances for the maximum coverage problem (Q1790189) (← links)
- A procedure for solution of the problem of optimal covering of a finite set (Q1968506) (← links)
- Mixed-integer programming approaches for the time-constrained maximal covering routing problem (Q2241905) (← links)
- A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) (← links)
- Solving the maximal covering location problem with heuristic concentration (Q2384889) (← links)
- An optimal algorithm for the minimum disc cover problem (Q2471803) (← links)
- A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem (Q3599128) (← links)
- Emergency service systems: The use of the hypercube queueing model in the solution of probabilistic location problems (Q3638852) (← links)
- (Q3970833) (← links)
- (Q4220474) (← links)
- (Q4433722) (← links)
- A practical heuristic for maximum coverage in large-scale continuous location problem (Q5080078) (← links)
- The Maximal Conditional Covering Problem (Q5689924) (← links)
- The Exact Subset MultiCover problem (Q6111957) (← links)
- Efficient presolving methods for solving maximal covering and partial set covering location problems (Q6168589) (← links)
- Accelerated Benders decomposition and local branching for dynamic maximum covering location problems (Q6568492) (← links)
- A hybrid adaptive iterated local search heuristic for the maximal covering location problem (Q6609706) (← links)