The minmax regret inverse maximum weight problem
From MaRDI portal
Publication:2243298
DOI10.1016/j.amc.2021.126328OpenAlexW3163307126MaRDI QIDQ2243298
Kien Trung Nguyen, Nguyen Thanh Hung
Publication date: 11 November 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2021.126328
Linear programming (90C05) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (1)
Cites Work
- Inverse 1-median problem on block graphs with variable vertex weights
- A linear time algorithm for inverse obnoxious center location problems on networks
- Algorithms for the partial inverse matroid problem in which weights can only be increased
- The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
- Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm
- Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
- Up- and downgrading the 1-center in a network
- Constrained inverse min-max spanning tree problems under the weighted Hamming distance
- On an instance of the inverse shortest paths problem
- Inverse matroid intersection problem
- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
- Variable-sized uncertainty and inverse problems in robust optimization
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
- A survey of network interdiction models and algorithms
- Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
- Inverse median problems
- Robust inverse optimization
- The partial inverse minimum spanning tree problem when weight increase is forbidden
- The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion
- A model for the inverse 1-median problem on trees under uncertain costs
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance
- The inverse maximum flow problem consideringl∞norm
- Inverse Optimization
- A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints
- Efficient Algorithms for the Inverse Spanning-Tree Problem
- Inverse maximum flow and minimum cut problems
- Combinatorial algorithms for inverse network flow problems
- Resource allocation in rooted trees for VLSI applications
- Inverse Bottleneck Optimization Problems on Networks
This page was built for publication: The minmax regret inverse maximum weight problem
