A branch\&cut approach to recharging and refueling infrastructure planning
From MaRDI portal
Publication:2315636
DOI10.1016/j.ejor.2019.06.031zbMath1430.90376OpenAlexW2949855124MaRDI QIDQ2315636
Publication date: 25 July 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.06.031
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items (2)
Optimizing the electrification of roads with charge-while-drive technology ⋮ Prescriptive analytics in public-sector decision-making: a framework and insights from charging infrastructure planning
Cites Work
- Unnamed Item
- A branch and price approach for routing and refueling station location model
- Battery swap station location-routing problem with capacitated electric vehicles
- Theoretical challenges towards cutting-plane selection
- The electric location routing problem with time windows and partial recharging
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- On the separation of maximally violated mod-\(k\) cuts
- The electric vehicle shortest-walk problem with battery exchanges
- Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model
- Maximally Violated Mod-p Cuts for the Capacitated Vehicle-Routing Problem
- Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study
- Mod‐2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets
This page was built for publication: A branch\&cut approach to recharging and refueling infrastructure planning