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 20 for “"Generalized Assignment Problem"”.
-
A Feasible Lagrangian Approach with Application to the Generalized Assignment Problem
… approach to solve difficult optimization problems that exhibit special structure. It provides a lower bound on the optimal objective of a minimization problem. On the other hand, an upper bound and quality feasible solutions may be obtained by perturbing solutions of the subproblem. In …
-
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 …
-
Determination of Selective reenlistment Bonus multipliers in the United States Marine Corps.
… multipliers is modeled as a nonlinear knapsack problem which is then linearized to a generalized assignment problem. The objective is to minimize the sum over all cells of a weighted squared deviation from the reenlistment target in each cell. Lagrangian relaxation provides lower bounds and …
-
Heuristic algorithms for solving a class of multiobjective zero-one programming problems
… zero-one integer linear programming problems. We present some useful concepts and propose some heuristic methods for finding the epsilon-nondominated solutions. The proposed method decomposes a multiobjective zero-one programming problem into a series of single objective problems. …
-
Time Slot Allocation and Management of E-grocery
… an exact and a heuristic approach for this problem in which an assignment of customers’ orders to vehicles is obtained by solving a generalized assignment problem with an objective function which minimizes the time used in the delivery leading to the minimization of the fuel consumption and …
-
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 …
-
The 0 -1 multiple knapsack problem
In operation research, the Multiple Knapsack Problem (MKP) is classified as a combinatorial optimization problem. It is a particular case of the Generalized Assignment Problem. The MKP has been applied to many applications in naval as well as financial management. There are several methods to solve …
-
Optimizing the U.S. Marine Corps' Selective Reenlisted Bonus program for the career force retention
… constraint. This model is implemented as a generalized assignment problem, and solved approximately on a personal computer using Lagrangian relaxation and a secondary heuristic. (The algorithm is programmed in Visual Basic for Applications and has an Excel interface.) Data for FY04 shows 491 …
-
Approximation Algorithms Via The Primal-Dual Schema: Applications Of The Simple Dual-Ascent Method To Problems From Logistics
… a large variety of combinatorial optimization problems. This technique relies upon simultaneously constructing a primal integer solution that is feasible for the minimization problem of interest, as well as a dual solution whose objective function value serves as a lower bound. By operating in …
-
MECHANISM DESIGN WITH GENERAL UTILITIES
… structural properties of optimization problems arising in mechanism design and to exploit them to design general frameworks and techniques for efficiently solving the underlying problems. Not only do our characterizations allow for efficient computation, they also reveal qualitative …
-
Efficient algorithms for online resource allocation and submodular maximization
… algorithms for fundamental optimization problems in online allocation and submodular maximization. We focus on algorithms that obtain strong theoretical guarantees without sacrificing practicality. We design algorithms with improved approximation guarantees and fast end-to-end running …
-
Coordenação de sistemas multiagente atuando em cenários complexos : uma abordagem baseada na divisão de trabalho dos insetos sociais
… e assim por diante. Esta flexibilidade é um problema chave nos sistemas multiagente e está relacionada a modelos de adaptação como os observados nos insetos sociais. O presente trabalho propõe uma abordagem para a geração e adaptação da organização de um sistema multiagente, em tempo de …
-
A column generation approach for stochastic optimization problems
… models for the following applications: (1) a generalized assignment problem (GAP) with uncertain resource capacity and unknown processing times and (2) a shift planning and scheduling problem (SPSP) with unknown demand that arises in the construction of the workforce at US Postal Service mail …
-
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. …
-
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. …
-
Reducing mixed-integer to zero-one programs
… the other hand, based on the complexity of the problems themselves. Thus, instead of always developing a new approach, the basic idea of this thesis was to check, if it is admirable to reduce several mixed integer programs to integer ones for which approved approaches are available and that can …
-
Resource allocation, content recommendation and online learning mechanisms for mobile edge networks
… Online Learning (OL) instances of optimization problems that span content recommendations and caching, user association and allocation of computing resources. We use a variety of mathematical tools to solve these problems, such as combinatorial optimization, convex optimization and Online Convex …
-
Energy efficient and adaptive service advertisement, discovery and provision for mobile ad hoc networks
… the dynamism of such networks and the arising problems thereof. This dynamism is due to the mobility of nodes, the wireless channel’s adverse and fast changing conditions and the energy limitations of mobile nodes, all of which lead to frequent disconnections and/or node failures. These …
-
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 …