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 17 of 17 for “"branch-and-price"”.

  1. Branch-and-Price for Prescriptive Contagion Analytics

    … in epidemiology, social sciences, engineering, and management. This thesis formalizes prescriptive contagion analytics problems where a centralized decision-maker allocates shared resources across multiple segments of a population, each governed by contagion dynamics. We define four real-world …

    mit Repository record for Branch-and-Price for Prescriptive Contagion Analytics (opens in a new tab)

  2. Optimizing Wildfire Suppression: A branch-and-price-and-cut approach

    … This thesis defines the Wildfire Suppression and Crew Assignment Problem, which optimizes resource allocation to triage fires based on damage risk, crew availability and spatiotemporal dynamics. We formulate a two-sided set partitioning model on time-space-rest networks for crew assignments …

    mit Repository record for Optimizing Wildfire Suppression: A branch-and-price-and-cut approach (opens in a new tab)

  3. Netzwerk-Design für zweistufige Transportsysteme und ein Branch-and-Price-Verfahren für das gemischte Direkt- und Hubflugproblem

    … fields of application of Operations Research and Mathematical Optimization. It offers great potential to reduce costs and to improve service quality. For the planning of large-scale regular service networks small daily savings of a few percent can imply substantial overall savings caused by …

    aachen Repository record for Netzwerk-Design für zweistufige Transportsysteme und ein Branch-and-Price-Verfahren für das gemischte Direkt- und Hubflugproblem (opens in a new tab)

  4. Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem

    … dissertation has been focused on exploiting the branch-and-price (BNP) method for the solution of various stochastic mixed integer programming problems (MIPs). In particular, we address the stochastic generalized assignment problem (SGAP), a hospital staff scheduling problem (HSSP), a stochastic …

    vt Repository record for Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem (opens in a new tab)

  5. Optimal Scheduling of Power Plant Maintenance with Gas Portfolio

    … horizon so that the overall costs are minimized and all the constraints are satisfied. Optimization in maintenance scheduling could reduce greenhouse gases and help meeting the surging global energy demand. Maintenance scheduling with gas portfolio could not only cut down the cost for purchasing …

    wvu Repository record for Optimal Scheduling of Power Plant Maintenance with Gas Portfolio (opens in a new tab)

  6. Solving Large Scale Crew Pairing Problems

    … flights of the timetable without breaking rules and regulations which are enforced by an airline. The problem has attracted many scientists in recent decades. The main challenge is that there is no general method to work well with all kinds of non-linear cost functions and rules. In order to …

    heid-diss Repository record for Solving Large Scale Crew Pairing Problems (opens in a new tab)

  7. Integrated Aircraft Fleeting, Routing, and Crew Pairing Models and Algorithms for the Airline Industry

    … have been trying to enhance their market shares and profit margins by composing favorable flight schedules and by efficiently allocating their resources of aircraft and crews so as to reduce operational costs. In practice, this is achieved based on demand forecasts and resource availabilities …

    vt Repository record for Integrated Aircraft Fleeting, Routing, and Crew Pairing Models and Algorithms for the Airline Industry (opens in a new tab)

  8. Models and advanced optimization algorithms for the integrated management of logistics operations

    … problems, namely the elementary shortest path and the vehicle routing problem with mixed linehauls and backhauls. In both problems, two-dimensional loading constraints are explicitly considered. Two column generation based approaches are proposed for the vehicle routing problem with …

    minho-thes Repository record for Models and advanced optimization algorithms for the integrated management of logistics operations (opens in a new tab)

  9. Models and algorithms for ground staff scheduling on airports

    … of challenging optimisation problems. Ground handling workloads are naturally represented as work tasks, e.g. for baggage unloading or passenger check-in. These workloads must be covered by appropriate employees. Staff scheduling is usually carried out in several stages: In demand planning, …

    aachen Repository record for Models and algorithms for ground staff scheduling on airports (opens in a new tab)

  10. Meal Delivery Optimisation for the Restaurant Chain

    … research. Inspired by the potential challenges and opportunities that the COVID-19 pandemic may present to chain catering food delivery services, this thesis proposes two innovative self-operated meal delivery solutions for restaurant chain companies with practical applicability, named as …

    uts Repository record for Meal Delivery Optimisation for the Restaurant Chain (opens in a new tab)

  11. Sports analytics and optimization for team formation problems

    … is the first to consider the NBA's draft, trade, and free agency aspects of player acquisition simultaneously. To inform vital parameters in this model, we develop predictive models to assign amateur players to archetypes, to quantify synergy between archetypes, and to predict the individual value …

    colo-mines Repository record for Sports analytics and optimization for team formation problems (opens in a new tab)

  12. New methods for branch-and-bound algorithms

    Branch-and-bound (B&B) algorithms, and extensions such as branch-and-price (B&P) are powerful tools for optimization. These algorithms are used in a wide variety of settings, and thus it is beneficial to develop new techniques to improve the performance of B&B algorithms that are independent of the …

    uiuc Repository record for New methods for branch-and-bound algorithms (opens in a new tab)

  13. Topics in Packing and Scheduling

    Packing and scheduling models include some of the most fundamental problems in operations research and computer science. These broad classes include a wide range of models with applications including logistics, production planning, wireless network design, circuit design, and cloud computing, to …

    gatech Repository record for Topics in Packing and Scheduling (opens in a new tab)

  14. Strategic Planning Models and Approaches to Improve Distribution Planning in the Industrial Gas Industry

    … represents a multi-billion dollar global market and provides essential product to manufacturing and service organizations that drive the global economy. In this dissertation, we focus on improving distribution efficiency in the industrial gas industry by addressing the strategic level problem of …

    vt Repository record for Strategic Planning Models and Approaches to Improve Distribution Planning in the Industrial Gas Industry (opens in a new tab)

  15. On some generalized routing problems

    … of combinatorial optimization in logistics and transport, and considers some mathematical optimization problems from the perspective of Operational Research:(i) the generalized directed rural postman problem (GDRPP)(ii) the vehicle routing problem with trailers and transshipments …

    aachen Repository record for On some generalized routing problems (opens in a new tab)

  16. Algorithms for multi-trip vehicle routing and device to device communications

    lethbridge

  17. Enhanced Formulations for Minimax and Discrete Optimization Problems with Applications to Scheduling and Routing

    … development of enhanced formulations for minimax and mixed-integer programming models for certain industrial and logistical systems, along with the design and implementation of efficient algorithmic strategies. We first examine the general class of minimax mixed-integer 0-1 problems of the type …

    vt Repository record for Enhanced Formulations for Minimax and Discrete Optimization Problems with Applications to Scheduling and Routing (opens in a new tab)