Optimal algorithms for integer inverse obnoxious p-median location problems on tree networks

DOI10.1007/S40314-023-02451-2MaRDI QIDQ6080433FDOQ6080433

Authors: Sepideh Mohammadi, Behrooz Alizadeh, Esmaeil Afrashteh 

Publication date: 2 October 2023

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationinverse optimizationtime complexityobnoxious median location

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cites Work

• Introduction to algorithms
• Title not available (Why is that?)
• Inverse median problems
• Inverse 1-median problem on block graphs with variable vertex weights
• Inverse 1-median problem on trees under weighted Hamming distance
• An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions
• Inverse \(p\)-median problems with variable edge lengths
• The inverse 1-median problem on a cycle
• Inverse median location problems with variable coordinates
• The inverse 1-maxian problem with edge length modification
• Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
• The \(p\)-maxian problem on a tree
• Foundations of location analysis
• A model for the inverse 1-Median problem on trees under uncertain costs
• Optimal algorithms for selective variants of the classical and inverse median location problems on trees
• The inverse \(p\)-maxian problem on trees with variable edge lengths
• A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
• 2-balanced flows and the inverse 1-median problem in the Chebyshev space
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
• Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
• Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks
• Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems

Cited In (3)

• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
• The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion
• Linear time optimal approaches for reverse obnoxious center location problems on networks

This page was built for publication: Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6080433)