(r|p)-centroid Problems on Networks with Vertex and Edge Demand

No abstract is available for this paper.

• Publication year

  2012

• Venue

  Computers & Operations Research

• Publication date

  2012-12-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.cor.2012.02.025
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Sequential competitive location on networks

  2013influential reference
• (r, P)-centroid Problems on Paths and Trees

  2009influential reference
• Location analysis: A synthesis and survey

  2005influential reference
• Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment

  2004cited by this paper
• On the use of genetic algorithms to solve location problems

  2002cited by this paper
• Foundations of Bilevel Programming

  2002cited by this paper
• Solving the Huff-Based Competitive Location Model on a Network with Link-Based Demand

  2002influential reference
• Introduction to algorithms [2nd ed.]

  2001cited by this paper
• Static competitive facility location: An overview of optimisation approaches

  2001cited by this paper
• On the (r|Xp)-Medianoid Problem on a Network with Vertex and Edge Demands

  2000influential reference
• Practical Bilevel Optimization: Algorithms and Applications

  1998cited by this paper
• An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems

  1997cited by this paper
• Sequential location problems

  1997influential reference
• Competitive Facility Location in the Plane

  1995cited by this paper
• TABU SEARCH ALGORITHMS FOR THE (R/XP)-MEDIANOID AND (R/P)-CENTROID PROBLEMS

  1994influential reference
• Competitive location in discrete space

  1994cited by this paper
• Competitive Location Models: A Framework and Bibliography

  1993cited by this paper
• Competitive location on a network

  1993cited by this paper
• Finite Dominating Sets for Network Location Problems

  1991cited by this paper
• Integer and Combinatorial Optimization

  1990cited by this paper
• Integer and Combinatorial Optimization

  1988cited by this paper
• Algorithms for Voting and Competitive Location on a Network

  1988cited by this paper
• Competitive Location on a Network

  1987cited by this paper
• Networks with condorcet solutions

  1985cited by this paper
• The Maximum Coverage Location Problem

  1983cited by this paper
• On locating new facilities in a competitive environment

  1983cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• Outcomes of voting and planning: Condorcet, Weber and Rawls locations

  1981cited by this paper
• Graphs, Networks, and Algorithms

  1980cited by this paper
• Johnson: computers and intractability: a guide to the theory of np- completeness (freeman

  1979cited by this paper
• Sequential location among firms with foresight

  1977cited by this paper
• Sequential Entry and Entry-Deterring Strategies in Spatial Competition

  1976cited by this paper
• Marktform und Gleichgewicht

  1935cited by this paper
• Stability in Competition

  1929influential reference

• Container depot location problem in the frame of the Polish part of the New Silk Road

  2020cites this paper
• Models and algorithms for competitive facility location problems with different customer behavior

  2016cites this paper
• On covering location problems on networks with edge demand

  2016cites this paper
• Competitive Location and Pricing on Networks with Random Utilities

  2015cites this paper
• Bilevel Programming and Applications

  2015cites this paper
• An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior

  2014cites this paper