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 41 for “"Lagrangian Relaxation"”.
-
Lagrangian relaxation for natural language decoding
… optimality guarantees. The main tool we utilize, Lagrangian relaxation, is a classical idea from the field of combinatorial optimization. We begin the dissertation by giving a general background introduction to the method and describe common models in natural language processing. The body of the …
-
Stochastic shortest path algorithm based on Lagrangian relaxation
… on the constraint. With fixed bound value, the Lagrangian relaxation method is applied to find the feasible solution to the constrained shortest path problem. During Lagrangian relaxation, a feasible solution close to the optimal is achieved through subgradient optimization. Among the candidate …
-
Exploratory research of Lagrangian relaxation for cloud workflow scheduling
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-02-04 without embargo terms
-
Exact decoding of phrase-based translation models through Lagrangian relaxation
… of phrase-based translation models, based on Lagrangian relaxation. Both methods recovers exact solutions, with certificates of optimality, on over 99% of test examples. The first method is much more efficient than approaches based on linear programming (LP) or integer linear programming (ILP) …
-
Efficient Lagrangian relaxation algorithms for exact inference in natural language tasks
… of model accuracy. In this thesis, we turn to Lagrangian relaxation as an alternative to approximate inference in natural language tasks. We demonstrate that Lagrangian relaxation algorithms provide efficient solutions while still maintaining formal guarantees. The approach leads to inference …
-
Lagrangian Relaxation / Dual Approaches For Solving Large-Scale Linear Programming Problems
… solving large-scale linear programming(LP) relaxations. Thus, it becomes imperative to employ an efficient method in solving these problems. It has been amply demonstrated that solving LP relaxations using a simplex-based algorithm, or even an interior-point type of procedure, can be …
-
The mixed-integer bilinear programming problem with extensions to zero-one quadratic programs
… to lead to a tighter linear programming relaxation than obtained through available linearization methods. Based on this linearization, a composite Lagrangian relaxation-implicit enumeration-cutting plane algorithm is developed. Extensive computational experience is provided to test the …
-
Análisis de la Relajación Lagrangiana como método de programación de talleres flexibles en un entorno multiagente
… distribuido y analiza el método de Relajación Lagrangiana para su aplicación como mecanismo de generación de precios en el contexto de las subastas combinatorias iterativas. El desarrollo de los sistemas multiagente ha permitido la implementación de sistemas distribuidos de programación y …
-
Optimal routes for electric vehicles facing uncertainty, congestion, and energy constraints
… the A-Star algorithm to find shortest paths, and Lagrangian relaxation allows us to solve the problem in seconds or less. For one example start and destination, our algorithms required less than 2 seconds for each instance (energy consumption limit). In addition, for example trips, we compute a …
-
Optimal configuration of digital communication network
… as a zero-one integer programming problem. The Lagrangian relaxation method and subgradient optimization procedure have been used to find reasonably good feasible solutions. Although the reliability for computer communication networks is as important as the cost factor, only the cost factor is …
-
A mathematical programming based model and algorithm for a two stage production process
… costs. The proposed algorithm is based on Lagrangian Relaxation and Benders' decomposition techniques, which exploit the inherent generalized assignment and travelling salesman problem substructures in the model. The algorithm is computationally intensive and generates (near) optimal …
-
Relaxation Adaptive Memory Programming For The Resource Constrained Project Scheduling Problem
… limits. In this study algorithms based on the relaxation adaptive memory programming (RAMP) method (Rego, 2005) are developed for the purpose of solving the RCPSP. The RAMP algorithms developed here combine mathematical relaxation, including Lagrangian relaxation and surrogate constraint …
-
A discrete equal-capacity p-Median problem
… obtain a lower bound on the problem by solving a Lagrangian relaxation of a reformulated problem via a conjugate subgradient optimization procedure. We obtain Benders’ cuts from the above procedures and proceed to a modified Benders’ approach to solve the continuous relaxation of the original …
-
Multidisciplinary design optimization of an eVTOL aircraft using analytical target cascading
… optimization subproblems. The augmented Lagrangian relaxation method is used to enforce consistency among shared design specifications across the overall system. Applying ATC provides the opportunity to isolate individual components of a complex system, establishes common interfaces …
-
GPU-based Lagrangian heuristic for multidimensional assignment problems with decomposable costs
… quick results are sought. In this work, we used Lagrangian relaxation technique to solve the MAPs with decomposable costs. But the major contribution was an efficient parallelization of this algorithm on a graphics processing unit (GPU) based programming architecture. Bigger problems with larger …
-
Computing upper and lower bounds on linear functional outputs from linear coercive partial differential equations
… domains. The method results from exploiting the Lagrangian saddle point property engendered by recasting the output problem as a constrained minimization problem. Localization is achieved by Lagrangian relaxation and the bounds are computed by appeal to a local dual problem. The proposed method …
-
Models for project management
… such as an extension to a very innovative Lagrangian relaxation approach recently proposed. The purpose of using genetic algorithms is twofold: first to obtain good approximations to very hard problems, and second to realize the limitations and virtues of this search technique. The purpose …
-
Reliable design of interdependent service facility systems under correlated disruption risks
… location and customer assignment decisions. Lagrangian relaxation based algorithms are designed to effectively solve the model. Multiple case studies are constructed to test the model and algorithm, and to demonstrate their performance and applicability. Next, when there exists no real access …
-
Evacuation Network Optimization: Models, Solution Methods and Applications
… problem complexity and combinatorial effect. A Lagrangian-relaxed, tabu-based solution method has been developed to solve this otherwise intractable problem, which takes advantage of Lagrangian relaxation for problem decomposition and complexity reduction and whose algorithmic design is based on …
-
Discrete Gate Sizing Methodologies for Delay, Area and Power Optimization
… mathematical expression and apply it to existing Lagrangian relaxation method, which is shown to converge to optimal solution. We demonstrate that the classic Elmore delay model based gate sizing approaches can still be valid. Therefore, our work might provide a new look into the numerous Elmore …
Page 1 of 3