Partial inverse min-max spanning tree problem
From MaRDI portal
Publication:830941
DOI10.1007/S10878-020-00656-3zbMATH Open1467.90054OpenAlexW3087800571MaRDI QIDQ830941FDOQ830941
Authors: Javad Tayyebi, Ali Reza Sepasian 
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
Recommendations
- The partial inverse minimum spanning tree problem when weight increase is forbidden
- Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm
- Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance
- Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
- Partial inverse maximum spanning tree problem under the Chebyshev norm
Cites Work
- Network flows. Theory, algorithms, and applications.
- A data structure for dynamic trees
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse Problem Theory and Methods for Model Parameter Estimation
- Some properties of the bilevel programming problem
- Title not available (Why is that?)
- Inverse Optimization
- Efficient Algorithms for the Inverse Spanning-Tree Problem
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm
- Weighted inverse minimum spanning tree problems under Hamming distance
- The partial inverse minimum spanning tree problem when weight increase is forbidden
- Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
- Title not available (Why is that?)
- Constrained inverse min-max spanning tree problems under the weighted Hamming distance
- The Min-Max Spanning Tree Problem and some extensions
- Title not available (Why is that?)
- A Faster Algorithm for the Inverse Spanning Tree Problem
- Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance
- 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
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- Robust inverse optimization
- An algorithm for inverse minimum spanning tree problem
- Fast and simple fully-dynamic cut tree construction
- Inverse optimization for the recovery of market structure from market outcomes: an application to the MISO electricity market
Cited In (10)
- Efficient Algorithms for the Inverse Spanning-Tree Problem
- Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm
- Expanding maximum capacity path under weighted sum-type distances
- Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance
- Approximation algorithms for capacitated partial inverse maximum spanning tree problem
- Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
- Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector
- The partial inverse minimum spanning tree problem when weight increase is forbidden
- Partial inverse maximum spanning tree problem under the Chebyshev norm
- Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance
This page was built for publication: Partial inverse min-max spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q830941)
