Pages that link to "Item:Q445338"
From MaRDI portal
The following pages link to Inverse 1-median problem on trees under weighted Hamming distance (Q445338):
Displayed 38 items.
- Inverse 1-median problem on block graphs with variable vertex weights (Q283940) (← links)
- The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance (Q320084) (← links)
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance (Q326486) (← links)
- The inverse 1-median problem on tree networks with variable real edge lengths (Q460433) (← links)
- Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector (Q723499) (← links)
- The inverse connected \(p\)-median problem on block graphs under various cost functions (Q827099) (← links)
- An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance (Q1670106) (← links)
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector (Q1685587) (← links)
- The inverse 1-center problem on cycles with variable edge lengths (Q1725838) (← links)
- Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks (Q1730835) (← links)
- Inverse quickest center location problem on a tree (Q1741512) (← links)
- Classical and inverse median location problems under uncertain environment (Q1987593) (← links)
- Inverse minimum flow problem under the weighted sum-type Hamming distance (Q2012059) (← links)
- Inverse group 1-median problem on trees (Q2031325) (← links)
- Constrained inverse minimum flow problems under the weighted Hamming distance (Q2049978) (← links)
- Inverse single facility location problem on a tree with balancing on the distance of server to clients (Q2076390) (← links)
- Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector (Q2089873) (← links)
- Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm (Q2205945) (← links)
- Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance (Q2240118) (← links)
- Capacitated partial inverse maximum spanning tree under the weighted Hamming distance (Q2279743) (← links)
- Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective (Q2318607) (← links)
- Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms (Q2330101) (← links)
- Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees (Q2337353) (← links)
- Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms (Q2632017) (← links)
- Inverse and reverse balanced facility location problems with variable edge lengths on trees (Q2656494) (← links)
- The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion (Q2656787) (← links)
- The cardinality constrained inverse center location problems on tree networks with edge length augmentation (Q2661775) (← links)
- A generalized interval type-2 fuzzy random variable based algorithm under mean chance value at risk criterion for inverse 1-median location problems on tree networks with uncertain costs (Q2668035) (← links)
- Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm (Q2687446) (← links)
- Linear time optimal approaches for reverse obnoxious center location problems on networks (Q2836087) (← links)
- Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems (Q4689388) (← links)
- Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance (Q5085261) (← links)
- Some polynomially solvable cases of the inverse ordered 1-median problem on trees (Q5162023) (← links)
- Optimal algorithms for selective variants of the classical and inverse median location problems on trees (Q5238068) (← links)
- Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks (Q6080433) (← links)
- (Q6112991) (← links)
- Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm (Q6191111) (← links)
- Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks (Q6192079) (← links)