Robust reverse 1-center problems on trees with interval costs
From MaRDI portal
(Redirected from Publication:6661114)
Recommendations
- Reverse 1-centre problem on trees under convex piecewise-linear cost function
- Further study on reverse 1-center problem on trees
- A note on the robust 1-center problem on trees
- New approaches to the robust 1-center location problems on tree networks
- Some robust inverse median problems on trees with interval costs
Cites work
- A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints
- A linear time algorithm for computing minmax regret 1-median on a tree network
- A linear time algorithm for the reverse 1‐median problem on a cycle
- A note on the robust 1-center problem on trees
- A survey of network interdiction models and algorithms
- Algorithms for the minmax regret path problem with interval data
- An improved algorithm for the minmax regret path center problem on trees
- An inverse approach to convex ordered median problems in trees
- An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Facility location problems with uncertainty on the plane
- Further study on reverse 1-center problem on trees
- scientific article; zbMATH DE number 2166303 (Why is no real title available?)
- Improving the location of minimax facilities through network modification
- Improving the location of minisum facilities through network modification
- Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
- Inverse 1-median problem on trees under weighted Hamming distance
- Inverse anti-k-centrum problem on networks with variable edge lengths
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse median problems
- Minmax-regret robust 1-median location on a tree
- On an instance of the inverse shortest paths problem
- On the minmax regret path median problem on trees
- Resource allocation in rooted trees for VLSI applications
- Reverse 1-center problem on weighted trees
- Reverse 2-median problem on trees
- Reverse selective obnoxious center location problems on tree graphs
- Robust absolute single machine makespan scheduling-location problem on trees
- Robust discrete optimization and its applications
- Robust inverse optimization
- Robust optimization
- Some reverse location problems
- The complexity analysis of the inverse center location problem
- The inverse 1-center problem on cycles with variable edge lengths
- The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
- The inverse Fermat-Weber problem
- The last-mile delivery process with trucks and drones under uncertain energy consumption
- The minmax regret inverse maximum weight problem
- The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach
- Variable-sized uncertainty and inverse problems in robust optimization
This page was built for publication: Robust reverse 1-center problems on trees with interval costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6661114)
