Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector
type: Item
instance of: scholarly article
title: Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector
zbMATH Open document ID: 1505.90134
author: Junhua Jia
author: Xiucui Guan
author: Qiao Zhang
author: Xinqiang Qian
author: Panos M. Pardalos
published in: Journal of Global Optimization
publication date: 2022-10-24T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7606091
zbMATH Keywords: inverse max+sum spanning tree
zbMATH Keywords: weighted \(l_\infty\) norm
zbMATH Keywords: binary search method
zbMATH Keywords: strongly polynomial time algorithm
MaRDI profile type: Publication
full work available at URL: s10898-022-01170-y
OpenAlex ID: W4280495550
cites work: A Faster Algorithm for the Inverse Spanning Tree Problem
cites work: The partial inverse minimum spanning tree problem when weight increase is forbidden
cites work: Some inverse optimization problems under the Hamming distance
cites work: Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
cites work: Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm
cites work: Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector
cites work: Inverse 1-median problem on trees under weighted Hamming distance
cites work: Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm
cites work: Inverse combinatorial optimization: a survey on problems, methods, and results
cites work: Efficient Algorithms for the Inverse Spanning-Tree Problem
cites work: Weighted inverse minimum spanning tree problems under Hamming distance
cites work: Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
cites work: Constrained inverse min-max spanning tree problems under the weighted Hamming distance
cites work: Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm
cites work: Algorithm for constraint partial inverse matroid problem with weight increase forbidden
cites work: Approximation algorithms for capacitated partial inverse maximum spanning tree problem
cites work: Solving combinatorial problems with combined min-max-min-sum objective and applications
cites work: On combined minmax-minsum optimization
cites work: An \(O(m\log n)\) algorithm for the max+sum spanning tree problem
cites work: Solving inverse spanning tree problems through network flow techniques
cites work: Partial inverse min-max spanning tree problem
cites work: Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
cites work: A general model of some inverse combinatorial optimization problems and its solution method under \(\ell_\infty\) norm
cites work: Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
DOI: 10.1007/S10898-022-01170-Y
description: scientific article; zbMATH DE number 7606091