The minmax regret inverse maximum weight problem

DOI10.1016/J.AMC.2021.126328MaRDI QIDQ2243298zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

uncertaintyrobustnessconvexityinverse optimizationminmax regret

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
• Minmax regret bottleneck problems with solution-induced interval uncertainty structure
• Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance
• Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
• Inverse optimization problems with multiple weight functions

Cites work

• A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints
• A linear time algorithm for inverse obnoxious center location problems on networks
• A model for the inverse 1-Median problem on trees under uncertain costs
• A survey of network interdiction models and algorithms
• Algorithms for the partial inverse matroid problem in which weights can only be increased
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Combinatorial algorithms for inverse network flow problems
• Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance
• Constrained inverse min-max spanning tree problems under the weighted Hamming distance
• Efficient Algorithms for the Inverse Spanning-Tree Problem
• Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective
• Inverse 1-median problem on block graphs with variable vertex weights
• Inverse Bottleneck Optimization Problems on Networks
• Inverse Optimization
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm
• Inverse matroid intersection problem
• Inverse maximum flow and minimum cut problems
• Inverse median problems
• Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
• Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
• On an instance of the inverse shortest paths problem
• On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
• Resource allocation in rooted trees for VLSI applications
• Robust inverse optimization
• Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
• The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion
• The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
• The inverse maximum flow problem consideringl_∞norm
• The partial inverse minimum spanning tree problem when weight increase is forbidden
• Up- and downgrading the 1-center in a network
• Variable-sized uncertainty and inverse problems in robust optimization

Cited in

(3)

• Some robust inverse median problems on trees with interval costs
• The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights
• Robust reverse 1-center problems on trees with interval costs

This page was built for publication: The minmax regret inverse maximum weight problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2243298)