Heuristic and lower bound for a stochastic location-routing problem
From MaRDI portal
(Redirected from Publication:864014)
Recommendations
Cites work
- scientific article; zbMATH DE number 4051316 (Why is no real title available?)
- scientific article; zbMATH DE number 956788 (Why is no real title available?)
- A Priori Optimization of the Probabilistic Traveling Salesman Problem
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- Combined location-routing problems: A synthesis and future research directions
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Integer Programming Formulation of Traveling Salesman Problems
- Introduction to Stochastic Programming
- Models and exact solutions for a class of stochastic location-routing problems
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- The stochastic generalised assignment problem with Bernoulli demands
Cited in
(23)- A taxonomical analysis, current methods and objectives on location-routing problems
- Public transportation hub location with stochastic demand: an improved approach based on multiple attribute group decision-making
- A hybrid clonal selection algorithm for the location routing problem with stochastic demands
- A survey of recent research on location-routing problems
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- On statistical bounds of heuristic solutions to location problems
- Location-routing: issues, models and methods
- A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study
- Models and exact solutions for a class of stochastic location-routing problems
- Robust facility location problem for hazardous waste transportation
- A compact model and tight bounds for a combined location-routing problem
- A profit-maximization location-routing-pricing problem: a branch-and-price algorithm
- The two-echelon stochastic multi-period capacitated location-routing problem
- Battery swap station location-routing problem with capacitated electric vehicles
- Stochastic hub location problems with Bernoulli demands
- A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands
- Location‐routing problem: a classification of recent research
- Distribution network design on the battlefield
- Location-aided routing with uncertainty in mobile ad hoc networks: a stochastic semidefinite programming approach
- A probabilistic bi-objective model for a humanitarian location-routing problem under uncertain demand and road closure
- A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs
- A two-stage robust approach to integrated station location and rebalancing vehicle service design in bike-sharing systems
- A survey of variants and extensions of the location-routing problem
This page was built for publication: Heuristic and lower bound for a stochastic location-routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864014)
