An approximation-based approach for chance-constrained vehicle routing and air traffic control problems
From MaRDI portal
Publication:3296386
DOI10.1007/978-3-030-22788-3_7zbMATH Open1446.90115OpenAlexW2971770739MaRDI QIDQ3296386FDOQ3296386
Authors: Lijian Chen 
Publication date: 7 July 2020
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-22788-3_7
Recommendations
- A polynomial approximation-based approach for chance-constrained optimization
- Approximating the chance-constrained capacitated vehicle routing problem with robust optimization
- Approximations for chance-constrained programming problems
- Exact algorithms for the chance-constrained vehicle routing problem
- Exact algorithms for the chance-constrained vehicle routing problem
Convex programming (90C25) Applications of mathematical programming (90C90) Stochastic programming (90C15)
Cites Work
- Asymptotic Statistics
- Introductory lectures on convex optimization. A basic course.
- Chance-constrained programming
- From CVaR to uncertainty set: implications in joint chance-constrained optimization
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Computational Experience with an M-Salesman Traveling Salesman Algorithm
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Title not available (Why is that?)
- Exact penalty functions in nonlinear programming
- The Vehicle Routing Problem with Stochastic Travel Times
- A Vehicle Routing Problem with Stochastic Demand
- Chance Constrained Programming with Joint Constraints
- Title not available (Why is that?)
- Lectures on stochastic programming. Modeling and theory.
- Title not available (Why is that?)
- Algorithms for stochastic mixed-integer programming models
- One Warehouse Multiple Retailer Systems with Vehicle Routing Costs
- Establishing delivery guarantee policies
- Separating capacity constraints in the CVRP using tabu search
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
- Note—A Note on “The Formulation of the M-Salesman Traveling Salesman Problem”
- A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
- Title not available (Why is that?)
- Log-concavity and strong log-concavity: a review
- Chance constrained programming models for refinery short-term crude oil scheduling problem
- An Application of Chance Constrained Programming to Portfolio Selection in a Casualty Insurance Firm
- Title not available (Why is that?)
- Approximation of convex data
Cited In (2)
Uses Software
This page was built for publication: An approximation-based approach for chance-constrained vehicle routing and air traffic control problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296386)
