The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation
From MaRDI portal
Publication:6047913
DOI10.1016/j.cor.2023.106354OpenAlexW4384343426MaRDI QIDQ6047913
Inmaculada Espejo, Alfredo Marín
Publication date: 13 September 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2023.106354
Cites Work
- Budget-constrained minimum cost flows
- Closest assignment constraints in discrete location problems
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
- New formulations for the uncapacitated multiple allocation hub location problem
- Upgrading \(p\)-median problem on a path
- Up- and downgrading the 1-center in a network
- Modifying edges of a network to obtain short subgraphs
- Approximation algorithms for certain network improvement problems
- On the flow cost lowering problem
- Upgrading nodes in tree-shaped hub location
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
- Upgrading the 1-center problem with edge length variables on a tree
- Upgrading min-max spanning tree problem under various cost functions
- Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach
- A combined facility location and network design problem with multi-type of capacitated links
- Improving spanning trees by upgrading nodes
- Optimizing the changing locations of mobile parcel lockers in last-mile distribution
- The accessibility arc upgrading problem
- A branch-and-cut algorithm for the median-path problem
- Upgrading edges in the maximal covering location problem
- The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
- Maximizing the minimum source-sink path subject to a budget constraint
- Edge Weight Reduction Problems in Directed Acyclic Graphs
- The budgeted minimum cost flow problem with unit upgrading cost
- Network upgrading problems
- Increasing the Weight of Minimum Spanning Trees
- Lowering eccentricity of a tree by node upgrading
- Upgrading arcs to minimize the maximum travel time in a network
This page was built for publication: The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation
