Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance

DOI10.1080/02331934.2011.651470zbMATH Open1236.49063OpenAlexW1977344114MaRDI QIDQ3225072FDOQ3225072

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

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
• Some inverse optimization problems under the Hamming distance

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)

Cites Work

• Inverse combinatorial optimization: a survey on problems, methods, and results
• The complexity analysis of the inverse center location problem
• Weighted inverse minimum spanning tree problems under Hamming distance
• Capacity inverse minimum cost flow problem
• 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
• Constrained inverse min-max spanning tree problems under the weighted Hamming distance
• Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
• Inverse Bottleneck Optimization Problems on Networks
• 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

Cited In (6)

• Title not available (Why is that?)
• The minmax regret inverse maximum weight problem
• Inverse Bottleneck Optimization Problems on Networks
• Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm
• 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

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)