Finite Dominating Sets for Network Location Problems

No abstract is available for this paper.

• Publication year

  1991

• Venue

  Operational Research

• Publication date

  1991-02-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1287/opre.39.1.100
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Solving Nonlinear Single-Facility Network Location Problems

  1986cited by this paper
• Technical Note - A Dominance Theorem for the Stochastic Queue Median Problem

  1986cited by this paper
• A correction to the definition of local center

  1985cited by this paper
• Optimal Location-Relocation Decisions on Stochastic Networks

  1985cited by this paper
• Optimal Server Location on a Network Operating as an M/G/1 Queue

  1985cited by this paper
• A Median Location Model with Nonclosest Facility Service

  1985cited by this paper
• Anticenters and antimedians of a network

  1983cited by this paper
• State of the Art-Location on Networks: A Survey. Part II: Exploiting Tree Network Structure

  1983cited by this paper
• The median problem with congestion

  1982cited by this paper
• Locating mobile servers on a network with markovian properties

  1982cited by this paper
• The generalized diameter of a graph

  1982cited by this paper
• Locating undesirable facilities on a network

  1981cited by this paper
• Location on networks : theory and algorithms

  1979cited by this paper
• Locating new passenger facilities on a transportation network

  1979cited by this paper
• Locations of Medians on Stochastic Networks

  1979cited by this paper
• Finding Minimal Center-Median Convex Combination Cent-Dian of a Graph

  1978cited by this paper
• Locating an Obnoxious Facility on a Network

  1978cited by this paper
• The m-Center Problem: Minimax Facility Location

  1977cited by this paper
• Optimum Locations of Centers in Networks

  1972cited by this paper
• The m-Center Problem

  1970cited by this paper
• An Extended Theorem for Location on a Network

  1967cited by this paper
• Optimum Locations on a Graph with Probabilistic Demands

  1966cited by this paper
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems

  1965cited by this paper
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

  1964cited by this paper

• Finding the minimum k-weighted dominating sets using heuristic algorithms

  2024cites this paper
• An edge scanning method for the continuous deviation‐flow refueling station location problem on a general network

  2021cites this paper
• On guarding real terrains: The terrain guarding and the blocking path problems

  2020cites this paper
• Optimal algorithms for weighted 1-center problem in deterministic and stochastic tree networks

  2020cites this paper
• Covering edges in networks

  2020cites this paper
• Approximability results for the p-centdian and the converse centdian problems

  2020influential citation
• Eternal and Secure Domination in Graphs

  2020cites this paper
• A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks

  2020cites this paper
• Multiple sink location problem in path networks with a combinational objective

  2020cites this paper
• Aggregation in Location

  2019cites this paper
• Ordered Median Location Problems

  2019cites this paper
• Facility Location Models

  2019cites this paper
• Interpolating between k-Median and k-Center:

  2019cites this paper
• The conditional p-dispersion problem

  2019cites this paper
• Minimax regret vertex centdian location problem in general dynamic networks

  2018cites this paper
• Location Problems with k-max Functions - Modelling and Analysing Outliers in Center Problems

  2018cites this paper
• Terrain visibility and guarding problems

  2017influential citation
• A new method for proving dominating uniqueness of graphs

  2017cites this paper
• Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Median

  2017cites this paper
• A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances

  2017cites this paper
• A finite dominating set of cardinality O(k) and a witness set of cardinality O(n) for 1.5D terrain guarding problem

  2017cites this paper
• The domination equivalence classes of paths

  2017cites this paper
• Near-Optimal Dominating Sets via Random Sampling

  2016cites this paper
• Growing the charging station network for electric vehicles with trajectory data analytics

  2015influential citation
• J-means and I-means for minimum sum-of-squares clustering on networks

  2015cites this paper
• Demand Point Aggregation for Some Basic Location Models

  2015cites this paper
• Full Length Research Article STRATEGIC TRANSPORT PLANNING FOR ODISHA MATCHING WITH CHANGING SCENARIOS OF CURRENT INDUSTRIALIZATION AND ECONOMIC POLICY IN 21 ST CENTURY

  2015cites this paper
• Theoretical and practical contributions on scatter search, variable neighborhood search and matheuristics for 0-1 mixed integer programs. (Contributions théoriques et pratiques pour la recherche dispersée, recherche à voisinage variable et matheuristique pour les programmes en nombres entiers mixtes

  2015cites this paper
• Domination polynomial of lexicographic product of specific graphs

  2015cites this paper
• On the Finite Optimality Set of the Vector Assignment p-Median Problem†

  2015cites this paper
• Location and quality selection for new facilities on a network market

  2014influential citation
• On the Roots of Domination Polynomials

  2014cites this paper
• The Dominated Coloring Problem and Its Application

  2014cites this paper
• Location and quality selection for new facilities on a network market

  2014cites this paper
• A dynamic programming based heuristic for locating stops in public transportation networks

  2014cites this paper
• Unreliable point facility location problems on networks

  2014cites this paper
• Double bound method for solving the p-center location problem

  2013cites this paper
• Exact solution Methodologies for the P-Center Problem under single and Multiple Allocation Strategies

  2013cites this paper
• On the Roots of Domination Polynomials

  2013cites this paper
• Sequential competitive location on networks

  2013cites this paper
• Supply Chain Design - Competitive and Financial Perspectives

  2013cites this paper
• Locating Two Transfer Points on a Network with a Trip Covering Criterion and Mixed Distances

  2013influential citation
• Variable neighborhood search for minimum sum-of-squares clustering on networks

  2012cites this paper
• Competitive location under proportional choice: 1-suboptimal points on networks

  2012cites this paper
• Location of Two Fire Stations in Five Sub-Metros of the Kumasi Metropolis

  2012cites this paper
• (r|p)-centroid Problems on Networks with Vertex and Edge Demand

  2012cites this paper
• Competitive location in networks with threshold-sensitive customer behaviour ∗

  2012cites this paper
• The Location of Undesirable Facilities

  2011cites this paper
• Discrete Center Problems

  2011cites this paper
• A note on the subtree ordered median problem in networks based on nestedness property

  2011cites this paper
• Exploiting Structure: Location Problems on Trees and Treelike Graphs

  2011cites this paper
• Multi-facility ordered median problems in directed networks

  2011cites this paper
• A bi-objective model for emergency services location-allocation problem with maximum distance constraint

  2011cites this paper
• On the structure of the solution set for the single facility location problem with average distances

  2011cites this paper
• Aggregating Data for the Flow-Intercepting Location Model: A Geographic Information System, Optimization, and Heuristic Framework: Aggregating Data for Flow-Intercepting Problems

  2010cites this paper
• Location modeling utilizing closest and generalized closest transport/interaction assignment constructs

  2010cites this paper
• Aggregation error for location models: survey and analysis

  2009cites this paper
• Finite dominating sets for the multi-facility ordered median problem in networks and algorithmic applications

  2009cites this paper
• The Continuous Stop Location Problem in Public Transportation Networks

  2009cites this paper
• Median Problems in Networks

  2009cites this paper
• Multi-Criteria Location Problem

  2009cites this paper
• A generalized model of equality measures in network location problems

  2008cites this paper
• The fuel-travel-back approach to hydrogen station siting

  2008cites this paper
• Population growth and the development of a central place system

  2008cites this paper
• Continuous space facility location for covering spatial demand objects

  2007cites this paper
• Location of Alternative-Fuel Stations Using the Flow-Refueling Location Model and Dispersion of Candidate Sites on Arcs

  2007cites this paper
• Minmax regret location-allocation problem on a network under uncertainty

  2007cites this paper
• EDITOR'S PROOF

  2006cites this paper
• Dispersion of Nodes Added to a Network

  2005cites this paper
• On the exponential cardinality of FDS for the ordered p-median problem

  2005cites this paper
• Thep-facility ordered median problem on networks

  2005cites this paper
• A framework for demand point and solution space aggregation analysis for location models

  2004cites this paper
• A review of network location theory and models

  2004cites this paper
• Fuzzy location problems on networks

  2004cites this paper
• The Sum Of Absolute Differences On A Network: Algorithm And Comparison With Other Equality Measures

  2003cites this paper
• Multifacility ordered median problems on networks: A further analysis

  2003cites this paper
• Locating a 1-Center on a Manhattan Plane with “Arbitrarily” Shaped Barriers

  2003cites this paper
• Infrastructure development for conversion to environmentally friendly fuel

  2002cites this paper
• An Improved Lower Bound for the Multimedian Location Problem

  2002cites this paper
• The collection depots location problem on networks

  2002influential citation
• A fractional model for locating semi-desirable facilities on networks

  2002cites this paper
• A new algorithm for the undesirable 1-center problem on networks

  2002cites this paper
• Una Revisión de Modelos para el Problema de Multi-Localización en Redes.

  2002cites this paper
• Algorithmic results for ordered median problems

  2002cites this paper
• Location of Facilities on a Network with Groups of Demand Points

  2001cites this paper
• A note on the location of an obnoxious facility on a network

  2000cites this paper
• The generalizedp-Centdian on network

  2000cites this paper
• An aggregation approach to solving the network p-median problem with link demands

  2000cites this paper
• Heuristics for multiple facility location in a network using the variance criterion

  2000cites this paper
• Aggregation Error Bounds for a Class of Location Models

  2000cites this paper
• A unified approach to network location problems

  1999cites this paper
• Classification of Location Problems

  1999cites this paper
• On crossings, the Crossing Postman Problem, and the Rural Postman Problem

  1999cites this paper
• An O(mn) Algorithm for the 1-maximin problem on a network

  1999cites this paper
• Applications of Set Covering, Set Packing and Set Partitioning Models: A Survey

  1998cites this paper
• THE 2-FACILITY CENTDIAN NETWORK PROBLEM

  1998cites this paper
• Admission Policies in Loss Queueing Models with Heterogeneous Arrivals

  1998cites this paper
• A spanning tree approach to the absolute p-center problem

  1998cites this paper
• On locating a single path-like facility in a general graph

  1997cites this paper
• Optimal solution of a total time distribution problem

  1996cites this paper