Inverse optimal value problem on minimum spanning tree under unit l_ norm

DOI10.1007/S11590-020-01553-8zbMATH Open1459.90218OpenAlexW3007798390MaRDI QIDQ2228401FDOQ2228401

Authors: Binwu Zhang, Xiucui Guan, Qiao Zhang 

Publication date: 17 February 2021

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-020-01553-8

Recommendations

• The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
• Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted \(l_\infty\) norm
• Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance
• Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector
• An algorithm for inverse minimum spanning tree problem

zbMATH Keywords

minimum spanning tree\(l_\infty\) normstrongly polynomial time algorithminverse optimal value problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Efficient Algorithms for the Inverse Spanning-Tree Problem
• Weighted inverse minimum spanning tree problems under Hamming distance
• The partial inverse minimum spanning tree problem when weight increase is forbidden
• Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
• Algorithm for constraint partial inverse matroid problem with weight increase forbidden
• Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
• Title not available (Why is that?)
• A Faster Algorithm for the Inverse Spanning Tree Problem
• Solving inverse spanning tree problems through network flow techniques
• The inverse optimal value problem
• A penalty function method for solving inverse optimal value problem
• Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector
• An algorithm for inverse minimum spanning tree problem
• Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
• A network flow method for solving some inverse combinatorial optimization problems
• Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector

Cited In (17)

• Inverse optimization problems with multiple weight functions
• Solving inverse spanning tree problems through network flow techniques
• Combinatorial algorithms for restricted inverse optimal value problems on minimum spanning tree under weighted \(l_1\) norm
• 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
• The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
• Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
• 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
• Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance
• The restricted inverse optimal value problem on shortest path under \(l_1\) norm on trees
• Best strategy to win a match: an analytical approach using hybrid machine learning-clustering-association rule framework
• Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted \(l_\infty\) norm
• Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector
• A penalty-type method for solving inverse optimal value problem in second-order conic programming
• Partial inverse maximum spanning tree problem under the Chebyshev norm

This page was built for publication: Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm

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