A note on the subtree ordered median problem in networks based on nestedness property

Research output: Journal article publicationJournal articleAcademic researchpeer-review

7 Citations (Scopus)


The nestedness property has become an increasingly important means for devising effcient algorithms for network location problems. In this paper we prove that the nestedness property holds for the tactical continuous, and strategic discrete and continuous subtree location problems in a tree network with the ordered median objective, where the λ-weights take at most two different values. These results extend some existing results in the literature. With these nestedness results, we solve the problems in polynomial time. Finally we pose an open problem on identifying the nestedness property for the (k1; k2)-trimmed problem.
Original languageEnglish
Pages (from-to)41-49
Number of pages9
JournalJournal of Industrial and Management Optimization
Issue number1
Publication statusPublished - 1 Feb 2012


  • Nestedness property
  • Strategic continuous
  • Strategic discrete
  • Subtree ordered median problem
  • Tactical continuous

ASJC Scopus subject areas

  • Business and International Management
  • Strategy and Management
  • Control and Optimization
  • Applied Mathematics

Cite this