Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance
From MaRDI portal
Publication:3225072
DOI10.1080/02331934.2011.651470zbMath1236.49063OpenAlexW1977344114MaRDI QIDQ3225072
Publication date: 15 March 2012
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2011.651470
Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Optimality conditions for minimax problems (49K35)
Related Items (3)
The cardinality constrained inverse center location problems on tree networks with edge length augmentation ⋮ The max-sum inverse median location problem on trees with budget constraint ⋮ The minmax regret inverse maximum weight problem
Cites Work
- Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm
- Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
- Constrained inverse min-max spanning tree problems under the weighted Hamming distance
- Inverse maximum capacity problems
- Weighted inverse minimum spanning tree problems under Hamming distance
- The complexity analysis of the inverse center location problem
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Capacity inverse minimum cost flow problem
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
- Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
- Some inverse optimization problems under the Hamming distance
- A simple min-cut algorithm
- Inverse Bottleneck Optimization Problems on Networks
This page was built for publication: Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance
