On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks.
Kien Trung NguyenHuong Nguyen-ThuNguyen Thanh HungPublished in: Math. Methods Oper. Res. (2018)
Keyphrases
- three dimensional
- convex constraints
- social networks
- network analysis
- convex optimization
- worst case
- rooted trees
- vapnik chervonenkis dimension
- network size
- piecewise linear
- computational complexity
- b tree
- space complexity
- median filter
- computer networks
- network design
- heterogeneous networks
- partially ordered
- tree structures
- tree structure
- multi dimensional
- objective function