Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector
From MaRDI portal
Publication:723499
DOI10.1007/s11590-017-1165-2zbMath1402.90196OpenAlexW2673609806MaRDI QIDQ723499
Xiucui Guan, Panos M. Pardalos, Binwu Zhang
Publication date: 31 July 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-017-1165-2
linear programminginverse optimizationcolumn generation algorithmdual theorymax+sum spanning tree problem
Related Items (9)
Approximation algorithms for capacitated partial inverse maximum spanning tree problem ⋮ 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 ⋮ 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 ⋮ Weak optimal inverse problems of interval linear programming based on KKT conditions ⋮ 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
Cites Work
- 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
- A heuristic algorithm for the mini-max spanning forest problem
- On combined minmax-minsum optimization
- 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
- New developments in the primal-dual column generation technique
- 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
- Inverse Optimization
- 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_1\) norm by modifying the sum-cost vector
