Optimal algorithms for inverse vertex obnoxious center location problems on graphs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Behrooz Alizadeh, Roghayeh Etemad. Optimal algorithms for inverse vertex obnoxious center location problems on graphs. Theoretical Computer Science, 707:36-45, 2018. [doi]

The following publications are possibly variants of this publication:

A linear time algorithm for inverse obnoxious center location problems on networksBehrooz Alizadeh, Rainer E. Burkard. cejor, 21(3):585-594, 2013. [doi]

Optimal algorithms for integer inverse obnoxious p-median location problems on tree networksSepideh Mohammadi, Behrooz Alizadeh, Esmaeil Afrashteh. cam, 42(7):312, October 2023. [doi]

Reverse selective obnoxious center location problems on tree graphsRoghayeh Etemad, Behrooz Alizadeh. mmor, 87(3):431-450, 2018. [doi]

Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star NetworksMehran Hasanzadeh, Behrooz Alizadeh, Esmaeil Afrashteh, Fahimeh Baroughi 0001. apjor, 38(4), 2021. [doi]

Combinatorial Algorithms for Some Variants of Inverse Obnoxious Median Location Problem on Tree NetworksBehrooz Alizadeh, Esmaeil Afrashteh, Fahimeh Baroughi Bonab. jota, 178(3):914-934, 2018. [doi]

runs on WebDSL