Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 64 for “"facility location problems"”.

  1. Multi-level facility location problems

    We study of a class of discrete facility location problems, called multi-level facility location problems, that has received major attention in the last decade. These problems arise in several applications such as in production-distribution systems, telecommunication networks, freight …

    concordia Download PDF for Multi-level facility location problems (opens in a new tab)

  2. On Continuous Connected Facility Location Problems

    An important but under-studied problem in location analysis is the so called connected facility location problem. In such a problem, each facility is connected with other facilities by a certain network structure and the problem seeks to optimize facility locations so that the total costs including …

    umn Repository record for On Continuous Connected Facility Location Problems (opens in a new tab)

  3. Message Passing Algorithms for Facility Location Problems

    Discrete location analysis is one of the most widely studied branches of operations research, whose applications arise in a wide variety of settings. This thesis describes a powerful new approach to facility location problems - that of message passing inference in probabilistic graphical models. …

    toronto-retro Repository record for Message Passing Algorithms for Facility Location Problems (opens in a new tab)

  4. Geometric Facility Location Problems on Uncertain Data

    In this dissertation, we study several facility location problems on uncertain data. We mainly consider the k-center problem and many of its variations. These are classical problems in computer science and operations research. These problems on deterministic data have been studied extensively in …

    utahstate Repository record for Geometric Facility Location Problems on Uncertain Data (opens in a new tab)

  5. Probabilistic formulations of some facility location problems

    The area of facilities location covers a wide variety of problems involving both public and private sector applications. To date, the study of location problems has been restricted primarily to deterministic formulations of the problem. The present research effort investigates the effect of random …

    vt Repository record for Probabilistic formulations of some facility location problems (opens in a new tab)

  6. Approximation Algorithms for Clustering and Facility Location Problems

    Facility location problems arise in a wide range of applications such as plant or warehouse location problems, cache placement problems, and network design problems, and have been widely studied in Computer Science and Operations Research literature. These problems typically involve an underlying …

    waterloo Repository record for Approximation Algorithms for Clustering and Facility Location Problems (opens in a new tab)

  7. Solving And Applications Of Multi-Facility Location Problems

    … the study and solving of a new class of multi-facility location problems. This class is of a great theoretical interest both in variational analysis and optimization while being of high importance to a variety of practical applications. Optimization problems of this type cannot be reduced to …

    wayne-thes Repository record for Solving And Applications Of Multi-Facility Location Problems (opens in a new tab)

  8. Approximation algorithms for clustering and facility location problems

    … we design and analyze algorithms for various facility location and clustering problems. The problems we study are NP-Hard and therefore, assuming P is not equal NP, there do not exist polynomial time algorithms to solve them optimally. One approach to cope with the intractability of these …

    uiuc Repository record for Approximation algorithms for clustering and facility location problems (opens in a new tab)

  9. Proportional Fairness and Strategic Behaviour in Facility Location Problems

    The one-dimensional facility location problem readily generalizes to many real world problems, including social choice, project funding, and the geographic placement of facilities intended to serve a set of agents. In these problems, each agent has a preferred point along a line or interval, which …

    unsw Repository record for Proportional Fairness and Strategic Behaviour in Facility Location Problems (opens in a new tab)

  10. Mechanism Design for Heterogeneous and Distributed Facility Location Problems

    … one of algorithmic game theory's main classes of problems, namely facility location problems. In the most classical setting, the goal is to locate one facility on a line given the reported positions of strategic agents, who aim to be as close to the facility as possible so that the agents do not …

    essex Download PDF for Mechanism Design for Heterogeneous and Distributed Facility Location Problems (opens in a new tab)

  11. An analysis of minimax facility location problems with area demands /

    The unconstrained model, and its solution technique can be easily modified to solve the limiting case where all facilities are fixed points, and also the case when metric constraints are added.

    oklahoma-thes Repository record for An analysis of minimax facility location problems with area demands / (opens in a new tab)

  12. Approximation algorithms for new graph partitioning and facility location problems

    … the fundamental questions can be abstracted as problems in combinatorial optimization. However, many of these problems are NP-hard, which makes it unlikely that exact polynomial-time algorithms for them exist. Approximation algorithms are designed to circumvent this difficulty, by finding …

    cornell Repository record for Approximation algorithms for new graph partitioning and facility location problems (opens in a new tab)

  13. Probabilistic formulations of some facility location problems in discrete space

    … problem can be stated as follows: determine the locations of the minimum number of facilities among a discrete set of feasible location sites in order to assure that the probability each customer is covered by some facility is no less than a specified value. The second problem treated involves …

    vt Repository record for Probabilistic formulations of some facility location problems in discrete space (opens in a new tab)

  14. Algorithms and hardness results for resource allocation and facility location problems

    … in market. In this thesis, we consider two such problems where we want to make decisions based on agent preferences. In our first problem, we study a variant of the classic housing markets model. Each agent is initially assigned a unique house, and the houses form a graph. Each agent has strict …

    texas Repository record for Algorithms and hardness results for resource allocation and facility location problems (opens in a new tab)

  15. General modelling and exact solution techniques for restricted facility location problems

    … techniques for restricted continuous facility location problems. In this work, forbidden regions and barriers are considered as the main restriction types for locations.<br/><br/>In the first search paper, a general modelling framework for restricted facility location problems is …

    soton Download PDF for General modelling and exact solution techniques for restricted facility location problems (opens in a new tab)

  16. Mechanism Design for Multi-dimensional Facility Location Problems: A Computational and Informational Perspective

    … of mechanism design without money called the facility location problem: suppose the municipal government plans to build several homogeneous facilities according to the reported preferred locations of the residents. Each resident would prefer one of the facilities built near his home/office (or …

    toronto-retro Repository record for Mechanism Design for Multi-dimensional Facility Location Problems: A Computational and Informational Perspective (opens in a new tab)

  17. Incorporating Conditional ß-Mean based Equity Metric in Coverage based Facility Location Problems

    A classical maximum coverage facility location problem (MCLP) tries to maximize the coverage by serving all possible demands within the specified coverage radius. Depending on the applications, several families of MCLP variants have been developed - each with its unique set of additional …

    portland-state Repository record for Incorporating Conditional ß-Mean based Equity Metric in Coverage based Facility Location Problems (opens in a new tab)

  18. New Formulations and Approaches to Facility Location Problems in the Presence of Barriers

    <p> This dissertation examines the facility location problems in the presence of barrier regions and consists basically of four essays exploring new problems. Despite the fact that the facility location problems considering barriers to travel are more realistic than their unrestricted counterparts, …

    mcmaster Repository record for New Formulations and Approaches to Facility Location Problems in the Presence of Barriers (opens in a new tab)

Page 1 of 4