Accelerated Benders decomposition and local branching for dynamic maximum covering location problems

Cites Work

A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty
Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design
The multimode covering location problem
The multi-period incremental service facility location problem
Generalized coverage: new developments in covering location models
Practical enhancements to the Magnanti-Wong method
A multicut algorithm for two-stage stochastic linear programs
Partitioning procedures for solving mixed-variables programming problems
Dynamic versions of set covering type public facility location problems
A Lagrangean heuristic for the maximal covering location problem
Computing approximate solutions of the maximum covering problem with GRASP
Scenario reduction in stochastic programming
Local branching
A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
The budgeted maximum coverage problem
Intelligent-guided adaptive search for the maximum covering location problem
Benders decomposition for very large scale partial set covering and maximal covering location problems
The Benders decomposition algorithm: a literature review
Multi-period stochastic covering location problems: modeling framework and solution approach
A maximal covering location model in the presence of partial coverage
A cutting plane algorithm for convex programming that uses analytic centers
Optimal emergency vehicles location: an approach considering the hierarchy and substitutability of resources
Large-scale influence maximization via maximal covering location
Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
The large-scale dynamic maximal covering location problem
Covering location problem of emergency service facilities in an uncertain environment
The incremental connected facility location problem
Solving the maximal covering location problem with heuristic concentration
A stochastic programming approach for supply chain network design under uncertainty
Benders Decomposition for Large-Scale Uncapacitated Hub Location
Accelerating Benders Decomposition by Local Branching
Iterated Greedy Algorithms for the Maximal Covering Location Problem
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Acceleration of cutting-plane and column generation algorithms: Applications to network design
Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
An exact algorithm for the maximal covering problem
Accelerating benders decomposition with heuristicmaster problem solutions
Implementing Automatic Benders Decomposition in a Modern MIP Solver
The Benders Dual Decomposition Method
A column generation approach for the maximal covering location problem
A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
Efficient presolving methods for solving maximal covering and partial set covering location problems
Optimising Electric Vehicle Charging Station Placement Using Advanced Discrete Choice Models

This page was built for publication: Accelerated Benders decomposition and local branching for dynamic maximum covering location problems