Computation of inverse 1-center location problem on the weighted trapezoid graphs
DOI10.35834/mjms/1559181623zbMath1452.05077OpenAlexW2964254397MaRDI QIDQ2212218
Sukumar Mondal, Biswanath Jana, Madhumangal Pal
Publication date: 19 November 2020
Published in: Missouri Journal of Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.mjms/1559181623
treetrapezoid graphsinverse optimizationcenter location1-center locationinverse 1-center locationtree-networks
Trees (05C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An inverse approach to convex ordered median problems in trees
- Inverse center location problem on a tree
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach
- The inverse 1-maxian problem with edge length modification
- The inverse 1-median problem on a cycle
- The inverse Fermat-Weber problem
- Inverse 1-center location problems with edge length augmentation on trees
- Trapezoid graphs and their coloring
- On an instance of the inverse shortest paths problem
- Dominations in trapezoid graphs
- Inverse matroid intersection problem
- Two general methods for inverse optimization problems
- The complexity analysis of the inverse center location problem
- Algorithmic graph theory and perfect graphs
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Calculating some inverse linear programming problems
- Computation of inverse 1-centre location problem on the weighted interval graphs
- Inverse median problems
- Some inverse optimization problems under the Hamming distance
- Inverse center location problems
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Location Theory
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Inverse Bottleneck Optimization Problems on Networks
- Depth-First Search and Linear Graph Algorithms
- A network flow method for solving some inverse combinatorial optimization problems
This page was built for publication: Computation of inverse 1-center location problem on the weighted trapezoid graphs
