Combinatorial algorithms for restricted inverse optimal value problems on minimum spanning tree under weighted \(l_1\) norm

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Algorithms for the partial inverse matroid problem in which weights can only be increased
Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm
Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector
Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
A penalty function method for solving inverse optimal value problem
Constrained inverse min-max spanning tree problems under the weighted Hamming distance
On an instance of the inverse shortest paths problem
A further study on inverse linear programming problems
Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm
The inverse optimal value problem
Weighted inverse minimum spanning tree problems under Hamming distance
Inverse combinatorial optimization: a survey on problems, methods, and results
Calculating some inverse linear programming problems
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
Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted \(l_\infty\) norm
Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector
Approximation algorithms for capacitated partial inverse maximum spanning tree problem
Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
The partial inverse minimum spanning tree problem when weight increase is forbidden
Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
Algorithm for constraint partial inverse matroid problem with weight increase forbidden
Solving Inverse Spanning Tree Problems Through Network Flow Techniques
Inverse Optimization
Efficient Algorithms for the Inverse Spanning-Tree Problem
An algorithm for inverse minimum spanning tree problem
A Faster Algorithm for the Inverse Spanning Tree Problem
A Faster Strongly Polynomial Minimum Cost Flow Algorithm

This page was built for publication: Combinatorial algorithms for restricted inverse optimal value problems on minimum spanning tree under weighted \(l_1\) norm