A location-or-routing problem with partial and decaying coverage
From MaRDI portal
Publication:2108134
Recommendations
- The gradual covering decay location problem on a network.
- A decomposition approach for the probabilistic maximal covering location-allocation problem
- The location routing problem with facility sizing decisions
- Some recent contributions to routing and location problems
- Probabilistic a priori routing-location problems
- A survey of variants and extensions of the location-routing problem
- A stochastic gradual cover location problem
- The probabilistic gradual covering location problem on a network with discrete random demand weights
- The multimode covering location problem
Cites work
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- A column generation approach for location-routing problems with pickup and delivery
- A computational comparison of flow formulations for the capacitated location-routing problem
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- A maximal covering location model in the presence of partial coverage
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- A simple and effective evolutionary algorithm for the capacitated location-routing problem
- A survey of recent research on location-routing problems
- A survey of the standard location-routing problem
- A survey of variants and extensions of the location-routing problem
- A taxonomical analysis, current methods and objectives on location-routing problems
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
- An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
- An exact method for the capacitated location-routing problem
- Gradual cover competitive facility location
- scientific article; zbMATH DE number 3115473 (Why is no real title available?)
- scientific article; zbMATH DE number 3943559 (Why is no real title available?)
- scientific article; zbMATH DE number 3950233 (Why is no real title available?)
- scientific article; zbMATH DE number 1749224 (Why is no real title available?)
- Integer Programming Formulation of Traveling Salesman Problems
- Location-routing: issues, models and methods
- Lower and upper bounds for the two-echelon capacitated location-routing problem
- Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management
- Optimization by simulated annealing
- Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
- Sequential and parallel large neighborhood search algorithms for the periodic location routing problem
- Solving the multi-vehicle multi-covering tour problem
- The bi-objective covering tour problem
- The bi-objective stochastic covering tour problem
- The Covering Salesman Problem
- The Covering Tour Problem
- The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm
- The generalized maximal covering location problem
- The gradual covering decay location problem on a network.
- The gradual covering problem
- The location routing problem using electric vehicles with constrained distance
- The median tour and maximal covering tour problems: Formulations and heuristics
- The multi-vehicle probabilistic covering tour problem
- The prize collecting traveling salesman problem
- The traveling-salesman problem
Cited in
(6)- The gradual covering decay location problem on a network.
- Multiperiod location-routing with decoupled time scales
- scientific article; zbMATH DE number 758441 (Why is no real title available?)
- Maximal covering location with partial coverage for second-level specialized health care services
- Recent developments in location-routing problems. Deterministic single-echelon, single-objective, single-period problems
- The ordered gradual covering location problem on a network
This page was built for publication: A location-or-routing problem with partial and decaying coverage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2108134)
