Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector
From MaRDI portal
Publication:2089873
DOI10.1007/s10898-022-01170-yzbMath1505.90134OpenAlexW4280495550MaRDI QIDQ2089873
Qiao Zhang, Xinqiang Qian, Panos M. Pardalos, Xiucui Guan, Junhua Jia
Publication date: 24 October 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-022-01170-y
binary search methodstrongly polynomial time algorithminverse max+sum spanning treeweighted \(l_\infty\) norm
Related Items (1)
Cites Work
- 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
- Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector
- Partial inverse min-max spanning tree problem
- 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 combined minmax-minsum optimization
- A general model of some inverse combinatorial optimization problems and its solution method under \(\ell_\infty\) norm
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
- Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm
- 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
- Approximation algorithms for capacitated partial inverse maximum spanning tree problem
- Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
- The partial inverse minimum spanning tree problem when weight increase is forbidden
- Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
- Some inverse optimization problems under the Hamming distance
- Algorithm for constraint partial inverse matroid problem with weight increase forbidden
- Solving Inverse Spanning Tree Problems Through Network Flow Techniques
- 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 weighted \(l_{\infty}\) norm by modifying max-weight vector
