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 21 for “"LP-relaxation"”.
-
Stochastic Assignment with Expiration
… we first provide a compact linear program (LP) formulation that upper bounds the expected value of an optimal algorithm. Based on this LP, we design a polynomial-time algorithm that guarantees an expected value of at least a $1 - 1/e$ fraction of the optimal expected value. We demonstrate …
-
Approximate inference in graphical models using LP relaxations
… inference based on linear programming (LP) relaxations. Our algorithms optimize over the cycle relaxation of the marginal polytope, which we show to be closely related to the first lifting of the Sherali-Adams hierarchy, and is significantly tighter than the pairwise LP relaxation. We …
-
Efficient Lagrangian relaxation algorithms for exact inference in natural language tasks
… 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 algorithms …
-
Decoding error-correcting codes via linear programming
… the application of linear programming (LP) relaxation to the problem of decoding an error-correcting code. Linear programming relaxation is a standard technique in approximation algorithms and operations research, and is central to the study of efficient algorithms to find good (albeit …
-
Optimizing paint blocking in an automobile assembly line : an application of specialized TSP's
… exploit special problem structure to solve the LP relaxation of this problem quickly using Lagrangean relaxation. We prove and use an order-within-color property to construct an enumerative formulation, and use a greedy approach to bound the LP optimum. We decompose the problem and solve smaller …
-
Data-driven algorithms for operational problems
… Choice-based Deterministic Linear Program, an LP relaxation to the problem, to near-optimality. Both algorithms only assume the ability to approximate the underlying single period problem. ACG inherits the empirical efficiency from the Column Generation heuristic, while PB enjoys provable …
-
A tractable optimization framework for Air Traffic Flow Management addressing fairness, collaboration and stochasticity
… instance of the deterministic problem; solve the LP relaxation of the adaptive problem using affine policies; and report extensive empirical results to study the inherent tradeoffs.
-
Sub-linear algorithms for graph problems
… We further extend our study to the LP-relaxation variants and to the streaming setting, obtaining the first streaming results for the fractional set cover problem. Lastly, we design local-access generators for a collection of fundamental random graph models. We demonstrate how to …
-
Global Optimization of the Nonconvex Containership Design Problem Using the Reformulation-Linearization Technique
… procedure based on linear programming (LP) relaxations. These relaxations are generated through an approximation scheme that first utilizes RSM to derive polynomial approximations to the objective function and the constraints, and then applies the RLT to obtain an LP relaxation. The …
-
Optimization of Markov Random Fields in Computer Vision
… minimized accurately using a Linear Programming (LP) relaxation, the state-of-the-art algorithm is too slow to be useful in practice. To alleviate this deficiency, we introduce an efficient LP minimization algorithm for dense CRFs. To this end, we develop a proximal minimization framework, where …
-
Optimization of Markov Random Fields in Computer Vision
… minimized accurately using a Linear Programming (LP) relaxation, the state-of-the-art algorithm is too slow to be useful in practice. To alleviate this deficiency, we introduce an efficient LP minimization algorithm for dense CRFs. To this end, we develop a proximal minimization framework, where …
-
Global Optimization of Nonconvex Factorable Programs with Applications to Engineering Design Problems
… approach based on linear programming (LP) relaxations generated through various approximation schemes that utilize, for example, the Mean-Value Theorem and Chebyshev interpolation polynomials, coordinated with a {em Reformulation-Linearization Technique} (RLT). The initial stage of the …
-
Approximation algorithms for clustering and facility location problems
… The algorithm is based on rounding a convex relaxation. We further consider several special cases of the problem and give improved approximation bounds for them. The CapKCenter problem is an extension of the well-known k-center problem: each facility has a maximum capacity on the number of …
-
A Disassembly Optimization Problem
… formulations are quite promising in terms of the LP relaxation bounds obtained and the number of branch and bound nodes explored to reach an optimal integer solution. These new formulations along with the results of experimentation are presented in Appendix A. To solve the disassembly optimization …
-
Tight Flow-Based Formulations for the Asymmetric Traveling Salesman Problem and Their Applications to some Scheduling Problems
… can be built by taking advantage of their relaxations (of integer variables, thereby, resulting in linear programs) to effectively solve large-size problems. In view of our objective, it is essential to have a formulation that is amenable to the development of an effective solution …
-
Enhanced Formulations for Minimax and Discrete Optimization Problems with Applications to Scheduling and Routing
… on machines. The tight linear programming relaxation that is induced by this formulation is then embedded in a globally convergent branch-and-bound algorithm. Furthermore, we design another novel formulation for the job-shop scheduling problem that possesses a tight continuous relaxation, …
-
A Mathematical Programming Based Procedure for the Scheduling of Lots in a Wafer Fab
… An algorithm is developed for tightening the LP relaxation of this 0-1 integer linear programming model (of the scheduling problem) leading to a better performance of the branch and bound procedure used for its solution. Lagrangian relaxation is applied on a carefully chosen set of constraints …
-
Enhanced Mixed Integer Programming Techniques and Routing Problems
… problem. In this case, a Linear Programming (LP) relaxation and some integrality requirements are all we have for tackling the problem, and we are ``forced" to use some general purpose techniques. The second one happens when mixed integer programming is used to address a somehow structured …
-
Routing algorithms for electronic design automation
… can be formulated as an integer linear program (ILP). A provably good approximation algorithm for the REP is developed by applying linear programming (LP) relaxation and a special rounding technique to the ILP. We further study the optimal layer assignment of a set of buses connecting two …
-
Stochastic Scheduling for a Network of MEMS Job Shops
… cut which when appended to the master problem helps in eliminating the suboptimal master solution. We also present alternative optimality and feasibility cuts obtained by modifying the disjunctive constraints in the subproblem so as to eliminate the big H terms in it. Although any large positive …
Page 1 of 2