The directional p-median problem : Definition , complexity , and algorithms

No abstract is available for this paper.

• Publication year

  2006

• Venue

  Unknown venue

• Publication date

  Unknown publication date

• Fields of study

  Not labeled

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The directional p-median problem with applications to traffic quantization and multiprocessor scheduling

  2003influential reference
• Optimal Quantization of Periodic Task Requests on Multiple Identical Processors

  2003influential reference
• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks

  2001cited by this paper
• Network distance characteristics that affect computational effort in p-median location problems

  2000cited by this paper
• Heuristic concentration: Two stage solution construction

  1997cited by this paper
• Proportionate progress: A notion of fairness in resource allocation

  1996cited by this paper
• Network and Discrete Location: Models, Algorithms, and Applications

  1995cited by this paper
• Finding a minimum weight K-link path in graphs with Monge property and applications

  1993influential reference
• Facility siting and integer-friendly programming

  1993cited by this paper
• A more efficient heuristic for solving largep-median problems

  1992cited by this paper
• Improved complexity bounds for location problems on the real line

  1991cited by this paper
• On the Complexity of Some Common Geometric Location Problems

  1984cited by this paper
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph

  1968cited by this paper
• The shortest route problem with constraints

  1966cited by this paper

• Symmetry-free algorithm for spectrum allocation: parallel implementations and evaluation

  2023cites this paper
• Periodic or aperiodic timetables? The case of a single line Extended

  2021cites this paper
• Designing integrated urban delivery systems using public transport

  2021cites this paper
• Genetic Algorithm with Cluster-first Route-second to Solve the Capacitated Vehicle Routing Problem with Time Windows

  2021cites this paper
• Investigation on Index of Accessibility to Public Transportation Services for Developing Feeder Network

  2018cites this paper
• Optimal domain decomposition using the global sensitivity analysis-based metaheuristic algorithm

  2017cites this paper
• Clustering de trajetórias

  2015cites this paper
• Using dual feasible functions to construct fast lower bounds for routing and location problems

  2015cites this paper
• On Data Staging Algorithms for Shared Data Accesses in Clouds

  2013cites this paper
• Performing location allocation measures with a GIS for fire stations in Toledo, Ohio

  2011cites this paper
• On Data Staging Strategies for Mobile Accesses to Cloud Services

  2011cites this paper
• On Optimal Tiered Structures for Network Service Bundles

  2011cites this paper
• Economic models for tiered network services

  2010cites this paper
• Infrastructure Location

  2010cites this paper
• Solving the p-Median Problem with Insights from Discrete Vector Quantization

  2009cites this paper
• On Bandwidth Tiered Service

  2009cites this paper
• A Data Grid File Replication Maintenance Strategy Using Bayesian Networks

  2008cites this paper
• TDM Emulation in Packet-Switched Networks

  2007cites this paper
• A dynamic file replication strategy in data grids

  2007cites this paper
• On Internet Tiered Service

  year unknowncites this paper