Solution approaches for the stochastic capacitated traveling salesmen location problem with recourse
From MaRDI portal
Publication:493248
DOI10.1007/s10957-014-0638-zzbMath1327.90148OpenAlexW1982530547MaRDI QIDQ493248
Francesca Maggioni, Luca Bertazzi
Publication date: 3 September 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-014-0638-z
Numerical mathematical programming methods (65K05) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)
Related Items (4)
The algebraic structure of the arbitrary-order cone ⋮ Location‐routing problem: a classification of recent research ⋮ A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping ⋮ A stochastic multi-stage fixed charge transportation problem: worst-case analysis of the rolling horizon approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Location-aided routing with uncertainty in mobile ad hoc networks: a stochastic semidefinite programming approach
- Facility location models for distribution system design
- Location-routing: issues, models and methods
- Stochastic semidefinite programming: a new paradigm for stochastic optimization
- Stochastic programming approach to optimization under uncertainty
- Facility location and supply chain management. A review
- Stochastic second-order cone programming in mobile ad hoc networks
- Heuristics and bounds for the travelling salesman location problem on the plane
- Second-order cone programming
- Location analysis: a synthesis and survey
- A stochastic programming approach for supply chain network design under uncertainty
- Minisum location of a traveling salesman
- A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks
- Probability Modelling and Optimal Location of a Travelling Salesman
- Introduction to Stochastic Programming
- Traveling Salesman Facility Location Problems
- Semidefinite Programming
- The Capacitated Traveling Salesman Location Problem
- Computation of Minimum-Volume Covering Ellipsoids
This page was built for publication: Solution approaches for the stochastic capacitated traveling salesmen location problem with recourse