Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance

DOI10.1080/02331934.2011.651470MaRDI QIDQ3225072zbMATH OpenOpenAlexFDO

Authors Xiucui Guan, Yangbo Cao

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

zbMATH Keywords

Hamming distanceminimum cutbicriteria inverse probleminverse bottleneck optimization problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Minimax problems in mathematical programming (90C47) Optimality conditions for minimax problems (49K35)

Recommendations

• Inverse Bottleneck Optimization Problems on Networks
• A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
• Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm
• scientific article; zbMATH DE number 6535313
• Some inverse optimization problems under the Hamming distance

Cites work

• A simple min-cut algorithm
• Capacity inverse minimum cost flow problem
• Constrained inverse min-max spanning tree problems under the weighted Hamming distance
• Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
• Inverse Bottleneck Optimization Problems on Networks
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm
• Inverse maximum capacity problems
• Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
• Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
• Some inverse optimization problems under the Hamming distance
• The complexity analysis of the inverse center location problem
• Weighted inverse minimum spanning tree problems under Hamming distance

Cited in

(6)

• 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
• scientific article; zbMATH DE number 6535313 (Why is no real title available?)
• Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm
• Inverse Bottleneck Optimization Problems on Networks
• The minmax regret inverse maximum weight problem

This page was built for publication: Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance

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