Robust reverse 1-center problems on trees with interval costs

DOI10.1080/10556788.2024.2346642MaRDI QIDQ6661114FDOQ6661114

Authors: Javad Tayyebi, Kien Trung Nguyen 

Publication date: 10 January 2025

Published in: Optimization Methods \& Software (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

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

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)