Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm
From MaRDI portal
Publication:883285
DOI10.1016/J.COR.2005.12.003zbMath1123.90060OpenAlexW2012547739MaRDI QIDQ883285
Publication date: 4 June 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.12.003
Related Items (8)
Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector ⋮ Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance ⋮ Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance ⋮ Inverse 1-median problem on trees under weighted Hamming distance ⋮ Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm ⋮ The minmax regret inverse maximum weight problem ⋮ Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector ⋮ Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector
Cites Work
- Unnamed Item
- Inverse maximum capacity problems
- Weight reduction problems with certain bottleneck objectives.
- The complexity analysis of the inverse center location problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Some inverse optimization problems under the Hamming distance
- The Constrained Bottleneck Problem in Networks
- Efficient Algorithms for the Inverse Spanning-Tree Problem
- Inverse maximum flow and minimum cut problems
- An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem
This page was built for publication: Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm
