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 7 of 7 for “"generalized assignment problem"”.
-
Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem
… 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 hospital staff scheduling problem (SHSSP), and a stochastic short-term personnel planning …
-
Ambulatory Clinic Scheduling
… fully explore the ambulatory clinic scheduling problem (CSP) and study the creation of ambulatory clinic schedules using mathematical models. We describe our experiences developing ambulatory clinic schedules for three healthcare facilities including the challenges we faced, lessons learned, and …
-
New methods for branch-and-bound algorithms
… algorithms that are independent of the specific problem being studied. This dissertation describes three such techniques. First, new results for the cyclic best-first search (CBFS) strategy are presented. This strategy groups subproblems into a list of contours which it repeatedly cycles through. …
-
Virtualization of multicast services in WiMAX networks
… multicast framework was modelled by using Generalized Assignment Problem (GAP) methodology. Mixed Integer Linear Programing (MILP) was implemented in MATLAB to solve the GAP model. This was to optimise the allocation of multicast traffic to the appropriate virtual networks. Thus, the …
-
Integer Programming for Discrete Optimization of the Agile Supply Chain Configuration Problem
… effectively solve the supply chain configuration problem by maximizing the technological competencies of the assigned suppliers, while meeting capacity and distance constraints. The column generation approach is adopted to resolve the issue of limited scalability of the traditional LP formulation. …
-
Primal-Dual Techniques for Online Algorithms and Mechanisms
… the rest of the input. For a given online problem, the goal is to design algorithms which are competitive against the offline optimal solutions. In a classical offline scenario, it is often common to see a dual analysis of problems that can be formulated as a linear or convex program. …
-
MATHEMATICAL PROGRAMMING METHODS FOR PARTIALLY UNDEFINED OPTIMIZATION MODELS
… su programmazione lineare misto-intera per un problema di facility location online con funzioni di profitto non lineari. Il nostro lavoro apporta contributi al campo della formulazione automatica di modelli di programmazione matematica e fornisce strumenti pratici per risolvere problemi di …