Inverse constrained bottleneck problems under weighted l_ norm

DOI10.1016/J.COR.2005.12.003zbMATH Open1123.90060OpenAlexW2012547739MaRDI QIDQ883285FDOQ883285

Authors: Xiucui Guan, Jianzhong Zhang 

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

Recommendations

• Inverse Bottleneck Optimization Problems on Networks
• Inverse bottleneck Steiner tree problem under norm
• Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance
• 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

zbMATH Keywords

inverse problemcomplexitycutconstrained bottleneck problemweighted \(l_{\infty }\) norm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse maximum flow and minimum cut problems
• The complexity analysis of the inverse center location problem
• Efficient Algorithms for the Inverse Spanning-Tree Problem
• Some inverse optimization problems under the Hamming distance
• The Constrained Bottleneck Problem in Networks
• Weight reduction problems with certain bottleneck objectives.
• Inverse maximum capacity problems
• An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem

Cited In (10)

• Inverse 1-median problem on trees under weighted Hamming distance
• The minmax regret inverse maximum weight problem
• Inverse bottleneck Steiner tree problem under norm
• Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector
• Inverse Bottleneck Optimization Problems on Networks
• Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm
• Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance
• Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance
• Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
• Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector

This page was built for publication: Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm

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