Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
From MaRDI portal
Publication:2385479
DOI10.1007/s10878-006-9016-6zbMath1198.90382OpenAlexW2039796154MaRDI QIDQ2385479
Xiao-guang Yang, Zhang, Jianzhong
Publication date: 12 October 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-006-9016-6
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25)
Related Items
The inverse parallel machine scheduling problem with minimum total completion time ⋮ Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector ⋮ Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance ⋮ 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 1-median problem on trees under weighted Hamming distance ⋮ Inverse min-max spanning tree problem under the weighted sum-type Hamming distance ⋮ Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm ⋮ Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm ⋮ The minmax regret inverse maximum weight problem ⋮ Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector ⋮ Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance ⋮ Constrained inverse min-max spanning tree problems under the weighted Hamming distance ⋮ Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector ⋮ Inverse optimization problems with multiple weight functions
Cites Work
- On an instance of the inverse shortest paths problem
- The Min-Max Spanning Tree Problem and some extensions
- A further study on inverse linear programming problems
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- Inverse maximum capacity problems
- The inverse optimal value problem
- Weighted inverse minimum spanning tree problems under Hamming distance
- Inverse conic programming with applications
- Two general methods for inverse optimization problems
- The complexity analysis of the inverse center location problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Inverse combinatorial optimization: a survey on problems, methods, and results
- An inverse problem of the weighted shortest path problem
- Inverse median problems
- Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values
- Solving Inverse Spanning Tree Problems Through Network Flow Techniques
- Inverse Optimization
- Efficient Algorithms for the Inverse Spanning-Tree Problem
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
- An algorithm for inverse minimum spanning tree problem
- A Faster Algorithm for the Inverse Spanning Tree Problem
- A network flow method for solving some inverse combinatorial optimization problems
This page was built for publication: Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
