Partial inverse min-max spanning tree problem
From MaRDI portal
Publication:830941
DOI10.1007/s10878-020-00656-3zbMath1467.90054OpenAlexW3087800571MaRDI QIDQ830941
Ali Reza Sepasian, Javad Tayyebi
Publication date: 10 May 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00656-3
Related Items
Expanding maximum capacity path under weighted sum-type distances ⋮ Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance ⋮ Partial inverse min-max spanning tree problem under the weighted 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm
- Some properties of the bilevel programming problem
- Constrained inverse min-max spanning tree problems under the weighted Hamming distance
- The Min-Max Spanning Tree Problem and some extensions
- Inverse maximum capacity problems
- Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm
- Trade-off preservation in inverse multi-objective convex optimization
- Weighted inverse minimum spanning tree problems under Hamming distance
- A data structure for dynamic trees
- Inverse combinatorial optimization: a survey on problems, methods, and results
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- Robust inverse optimization
- The partial inverse minimum spanning tree problem when weight increase is forbidden
- Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
- Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance
- Inverse Optimization
- Efficient Algorithms for the Inverse Spanning-Tree Problem
- An algorithm for inverse minimum spanning tree problem
- Inverse Problem Theory and Methods for Model Parameter Estimation
- Fast and Simple Fully-Dynamic Cut Tree Construction
- A Faster Algorithm for the Inverse Spanning Tree Problem
- Inverse Optimization for the Recovery of Market Structure from Market Outcomes: An Application to the MISO Electricity Market
