Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
From MaRDI portal
Publication:1685587
DOI10.1007/s10898-017-0546-5zbMath1385.90031OpenAlexW2734739073MaRDI QIDQ1685587
Xinyan He, Binwu Zhang, Panos M. Pardalos, Xiucui Guan
Publication date: 14 December 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0546-5
Hamming distanceinverse optimization problemapproximability\(l_0\) normmax + sum spanning tree problem
Related Items (14)
An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance ⋮ The cardinality constrained inverse center location problems on tree networks with edge length augmentation ⋮ Approximation algorithms for capacitated partial inverse maximum spanning tree problem ⋮ Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector ⋮ Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance ⋮ Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm ⋮ Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks ⋮ Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm ⋮ The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm ⋮ Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance ⋮ Constrained inverse minimum flow problems under the weighted Hamming distance ⋮ Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector ⋮ Partial inverse maximum spanning tree problem under the Chebyshev norm ⋮ Inverse optimization problems with multiple weight functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Minimum deviation and balanced optimization: A unified approach
- Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm
- Constrained inverse min-max spanning tree problems under the weighted Hamming distance
- An \(O(m\log n)\) algorithm for the max+sum spanning tree problem
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- On combined minmax-minsum optimization
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
- Weighted inverse minimum spanning tree problems under Hamming distance
- Solving combinatorial problems with combined min-max-min-sum objective and applications
- Inverse combinatorial optimization: a survey on problems, methods, and results
- 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
- Some inverse optimization problems under the Hamming distance
- Solving Inverse Spanning Tree Problems Through Network Flow Techniques
- Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance
- Efficient Algorithms for the Inverse Spanning-Tree Problem
- A Faster Algorithm for the Inverse Spanning Tree Problem
This page was built for publication: Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
