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 77 for “"Network design problems"”.

  1. Hub Network Design Problems with Profits

    … this thesis we study a new class of hub location problems denoted as \textit{hub network design problems with profits} which share the same feature: a profit oriented objective. We start from a basic model in which only routing and location decisions are involved. We then investigate more …

    concordia Download PDF for Hub Network Design Problems with Profits (opens in a new tab)

  2. Approximation Algorithms for Relative Survivable Network Design Problems

    The Survivable Network Design (SND) problem is a classical and well-studied graph connectivity problem. Given a set of source-sink pairs and demands between them, SND asks one to compute a subgraph such that the number of paths between each pair meets their demand. SND is primarily interesting in …

    waterloo Repository record for Approximation Algorithms for Relative Survivable Network Design Problems (opens in a new tab)

  3. Node-weighted prize-collecting survivable network design problems

    We consider node-weighted network design problems, in particular the survivable network design problem SNDP and its prize-collecting version PC-SNDP. The input consists of a node-weighted undirected graph $G=(V,E)$ and integral connectivity requirements $r(st)$ for each pair of nodes $st$. The goal …

    uiuc Repository record for Node-weighted prize-collecting survivable network design problems (opens in a new tab)

  4. Network-Design Problems in Graphs and on the Plane

    A network design problem defines an infinite set whose elements, called instances, describe relationships and network constraints. It asks for an algorithm that, given an instance of this set, designs a network that respects the given constraints and at the same time optimizes some given criterion. …

    wurz-thes Repository record for Network-Design Problems in Graphs and on the Plane (opens in a new tab)

  5. A decomposition approach to solving core network design problems

    Traditionally, when automated planning is used, network planners solve multilayer core network problems in a top-down manner, solving capacities for the top-most layer, and then using these solved capacities to solve the next lower layer. This results in a suboptimal solution, yielding higher …

    nwu-za Repository record for A decomposition approach to solving core network design problems (opens in a new tab)

  6. New Algorithmic Solutions for Some Clustering and Network Design Problems

    … optimization problem, namely clustering and network design problems. In the first part, we study clustering problems under various computation models inspired by modern data analysis tasks. Specifically, we study clustering tasks on distributed, dynamic, or online data input, with possible …

    buffalo Repository record for New Algorithmic Solutions for Some Clustering and Network Design Problems (opens in a new tab)

  7. Survivable network design problems with element and vertex connectivity requirements

    … degree-bounded element-connectivity Survivable Network Design Problem (Elem-SNDP) and degree-bounded Rooted k-outconnectivity Problem. We suggest bicriteria approximation algorithms that are motivated by Ene and Vakilian's work in [1] and Lau and Zhou's work in [2]. The algorithm follows the …

    uiuc Repository record for Survivable network design problems with element and vertex connectivity requirements (opens in a new tab)

  8. Considering inventory in service parts logistics network design problems with time-based service constraints

    We study the integrated logistics network design and inventory stocking problem as characterized by the interdependency of design and stocking decisions in service parts logistics. These two sets of decisions usually have been considered sequentially in practice, and their associated problems have …

    texas Repository record for Considering inventory in service parts logistics network design problems with time-based service constraints (opens in a new tab)

  9. Exact Approaches for a Class of Nonlinear Discrete Facility Location and Network Design Problems

    Many real-world problems are intrinsically mixed-integer nonlinear optimization models, which are challenging to solve due to the combinatorial complexity resulting from discrete decision variables and nonlinear functions. Mixed-integer second-order cone programming (MISOCP) is one of the promising …

    concordia Download PDF for Exact Approaches for a Class of Nonlinear Discrete Facility Location and Network Design Problems (opens in a new tab)

  10. Bayesian Ranking And Selection Models For Discrete Network Design Problems With Uncertainties And Multiple Environmental Objectives

    … framework for single and multi-objective Network Design Problem with Uncertainty (NDPU). NPDU is a classical problem in transportation sciences and engineering. Due to the complex bi-level nature, NDPU is usually solved with heuristic algorithms where the objective value of many candidate …

    cornell Repository record for Bayesian Ranking And Selection Models For Discrete Network Design Problems With Uncertainties And Multiple Environmental Objectives (opens in a new tab)

  11. Space-Time Transportation System Modelling: from Traveler’s Characteristics to the Network Design Problem

    Traditional network design problems only consider the long-term stationary travel patterns (e.g., fixed OD demand) and short-term variations of human mobility are ignored. This study aims to integrate human mobility characteristics and travel patterns into network design problems using a space-time …

    usf Repository record for Space-Time Transportation System Modelling: from Traveler’s Characteristics to the Network Design Problem (opens in a new tab)

  12. A submodular representation for hub networkdesign problems with profits and single assignments

    Hub network design problems (HNDPs) lie at the heart of network design planning in transportation and telecommunication systems. They constitute a challenging class of optimization problems that focus on the design of a hub network. In this work, we study a class of HNDPs, named hub network design …

    concordia Download PDF for A submodular representation for hub networkdesign problems with profits and single assignments (opens in a new tab)

  13. Approximation Algorithms for New Problems in Network Design

    Due to the ubiquity of graphs and networks in real-world settings, an important and thus well-studied class of problems in combinatorial optimization are network design problems; these are problems that deal with the efficient design of networks. We introduce new, well-motivated network design …

    jhu Repository record for Approximation Algorithms for New Problems in Network Design (opens in a new tab)

  14. Online And Offline Facility Location And Network Design

    … a few online and offline facility location and network design problems, including an offline facility location model with submodular opening costs, an online prize-collecting facility location model, an offline singledemand capacitated facility location model and an online prize-collecting …

    cornell Repository record for Online And Offline Facility Location And Network Design (opens in a new tab)

  15. Valid Inequalities and Facets for Multi-Module (Survivable) Capacitated Network Design Problem

    … to solve the multi-module (survivable) network design problem. Many real-world decision-making problems can be modeled as network design problems, especially on networks with capacity requirements on arcs or edges. In most cases, network design problems of this type that have been …

    tamu Repository record for Valid Inequalities and Facets for Multi-Module (Survivable) Capacitated Network Design Problem (opens in a new tab)

  16. Exact and metaheuristic approaches for network desing problems

    … structure for modeling such interactions is a network. Thus, Network Design plays an important role for facilitating the interactions. Nevertheless, the majority of Network Design problems are difficult to solve. Our goal is to study them from the Combinatorial Optimization point of view to …

    sevilla Repository record for Exact and metaheuristic approaches for network desing problems (opens in a new tab)

  17. Online Decision Making via Prophet Setting

    In the study of online problems, it is often assumed that there exists an adversary who acts against the algorithm and generates the most challenging input for it. This worst-case assumption in addition to the complete uncertainty about future events in the traditional online setting sometimes …

    maryland Repository record for Online Decision Making via Prophet Setting (opens in a new tab)

Page 1 of 4