Partial inverse min-max spanning tree problem
type: Item
instance of: scholarly article
title: Partial inverse min-max spanning tree problem
zbMATH Open document ID: 1467.90054
author: Javad Tayyebi
author: Ali Reza Sepasian
published in: Journal of Combinatorial Optimization
publication date: 2021-05-10T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C47
zbMATH DE Number: 7346753
zbMATH Keywords: spanning trees
zbMATH Keywords: inverse problems
zbMATH Keywords: Manhattan distance
zbMATH Keywords: bottleneck type
MaRDI profile type: Publication
full work available at URL: s10878-020-00656-3
OpenAlex ID: W3087800571
cites work: Q3056948
cites work: A Faster Algorithm for the Inverse Spanning Tree Problem
cites work: Inverse Optimization
cites work: Some properties of the bilevel programming problem
cites work: Inverse Optimization for the Recovery of Market Structure from Market Outcomes: An Application to the MISO Electricity Market
cites work: The partial inverse minimum spanning tree problem when weight increase is forbidden
cites work: The Min-Max Spanning Tree Problem and some extensions
cites work: Trade-off preservation in inverse multi-objective convex optimization
cites work: Q3059325
cites work: Robust inverse optimization
cites work: Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm
cites work: Fast and Simple Fully-Dynamic Cut Tree Construction
cites work: Weighted inverse minimum spanning tree problems under Hamming distance
cites work: Inverse combinatorial optimization: a survey on problems, methods, and results
cites work: Efficient Algorithms for the Inverse Spanning-Tree Problem
cites work: Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm
cites work: Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance
cites work: Constrained inverse min-max spanning tree problems under the weighted Hamming distance
cites work: Q4845371
cites work: The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
cites work: A data structure for dynamic trees
cites work: Inverse Problem Theory and Methods for Model Parameter Estimation
cites work: Inverse maximum capacity problems
cites work: Q4716335
cites work: An algorithm for inverse minimum spanning tree problem
cites work: Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
DOI: 10.1007/S10878-020-00656-3
description: scientific article; zbMATH DE number 7346753