Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm

DOI10.1007/s10898-014-0140-zzbMath1335.90105OpenAlexW2057801831MaRDI QIDQ486731

Xia Zuo, Panos M. Pardalos, Xiucui Guan

Publication date: 16 January 2015

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-014-0140-z

zbMATH Keywords

inverse optimization problem\(l_\infty \) normdiscrete-ype Newton methodinverse max + sum spanning tree problemlinear fractional combinatorial optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Fractional programming (90C32) Combinatorial optimization (90C27)

Related Items (12)

Partial inverse min-max spanning tree problem ⋮ Post factum analysis for robust multiple criteria ranking and sorting ⋮ 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 ⋮ Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm ⋮ Capacitated partial inverse maximum spanning tree under the weighted Hamming distance ⋮ Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector ⋮ 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 ⋮ Partial inverse maximum spanning tree problem under the Chebyshev norm

Uses Software

• Matgraph

Cites Work

• Unnamed Item
• 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
• A heuristic algorithm for the mini-max spanning forest problem
• On combined minmax-minsum optimization
• A general model of some inverse combinatorial optimization problems and its solution method under \(\ell_\infty\) norm
• Weighted inverse minimum spanning tree problems under Hamming distance
• Two general methods for inverse optimization problems
• 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
• The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments
• Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
• A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm
• Some inverse optimization problems under the Hamming distance
• 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 by modifying the sum-cost vector under weighted \(l_\infty \) norm