Robust reverse 1-center problems on trees with interval costs

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
An inverse approach to convex ordered median problems in trees
Inverse 1-median problem on trees under weighted Hamming distance
A linear time algorithm for computing minmax regret 1-median on a tree network
Improving the location of minisum facilities through network modification
An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree
Reverse 2-median problem on trees
The inverse Fermat-Weber problem
On an instance of the inverse shortest paths problem
Robust discrete optimization and its applications
Some reverse location problems
Reverse selective obnoxious center location problems on tree graphs
Variable-sized uncertainty and inverse problems in robust optimization
The inverse 1-center problem on cycles with variable edge lengths
The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach
Facility location problems with uncertainty on the plane
The complexity analysis of the inverse center location problem
A note on the robust 1-center problem on trees
Inverse combinatorial optimization: a survey on problems, methods, and results
Inverse anti-\(k\)-centrum problem on networks with variable edge lengths
An improved algorithm for the minmax regret path center problem on trees
Algorithms for the minmax regret path problem with interval data
The minmax regret inverse maximum weight problem
Robust absolute single machine makespan scheduling-location problem on trees
A survey of network interdiction models and algorithms
Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
On the minmax regret path median problem on trees
Inverse median problems
Robust inverse optimization
The last-mile delivery process with trucks and drones under uncertain energy consumption
Reverse 1-center problem on weighted trees
Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints
Minmax-regret robust 1-median location on a tree
Improving the location of minimax facilities through network modification
Further Study on Reverse 1-Center Problem on Trees
Resource allocation in rooted trees for VLSI applications
A linear time algorithm for the reverse 1‐median problem on a cycle

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)