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 67 for “"LINEAR PROGRAMMING RELAXATION"”.
-
Decomposition-based methods for Connectivity Augmentation Problems
… decomposition based method and uses a novel linear programming relaxation called the $\gamma $-bundle LP. We then present a subsequent result by Fiorini, Gross, Konemann and Sanita who give a $3/2+\epsilon$ approximation algorithm for the same problem. This result uses what are known as …
-
Worst-case bounds for bin-packing heuristics with applications to the duality gap of the one-dimensional cutting stock problem
… can be and are best expressed in terms of the linear programming relaxation of the corresponding cutting stock problem. The concept of recurrency is introduced for a bin-packing heuristic, which allows a more natural derivation of a measure for the worst-case behaviour. The ideas are tested on …
-
Approximation Algorithms for Network Connectivity Problems
… an upper bound on the integrality gap of its linear programming relaxation. We also introduce a new, useful, extension of the minimum spanning tree problem, called the Extended Minimum Spanning Tree Problem (EMST), that is based on a special case of VCC; and provide both a polynomial-time …
-
On Applying Methods for Graph-TSP to Metric TSP
… TSP tour and the cost of the optimal subtour linear programming relaxation for small instances of graph-TSP, which was previously unknown. We also provide a simplified algorithm for special graph-TSP instances based on the subtour linear programming relaxation.
-
Optimization tools for process planning
… be formulated as a multiperiod, mixed-integer linear program (MILP). This MILP can then be reformulated by exploiting lot sizing substructures. While the reformulation produces a tight linear programming relaxation, it also introduces a large number of variables and constraints.
-
Contemporary Approaches to the Solution of the Integer Programming Problem
… of the methods for solution to the integer linear programming problem. The thesis simultaneously discusses some main approaches that lead to the development of the algorithms for the solution to the integer linear programming problem. Chapter 1 introduces the Generalized Linear Programming …
-
Evaluating Mixed-Integer Programming Models over Multiple Right-hand Sides
… measure of the quality of a mixed-integer programming (MIP) model with fixed data is the difference, or gap, between the optimal objective value of the linear programming relaxation and that of the corresponding MIP. In many contexts, only an approximation of the right-hand sides may be …
-
Design and analysis of algorithms for solving some stochastic vehicle routing and scheduling problems
… is formulated as a set-covering problem and its linear programming relaxation is solved to optimality by a column generation scheme to get an upper bound. For small size problems with long service time, the heuristics are compared against the upper bound; for other cases, they are compared among …
-
A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem
… thesis is concerned with the analysis of a Rectilinear Distance Location Allocation Problem, where the costs are directly proportional to rectilinear distances and the amount shipped. The problem is formulated as a Mixed Integer Bilinear Programming Problem and as a Discrete Location Allocation …
-
Overbooking in airline revenue management
… oversales decisions in the underlying linear programming relaxation. Several structural properties of the algorithms are also derived.
-
Benders decomposition and an IP-based heuristic for selecting IMRT treatment beam angles
… as well as develop a two-stage integer programming-based heuristic. Benders decomposition is first implemented in the traditional manner by iteratively solving the restricted master problem, and then identifying and adding the violated Benders cut. We also implemented Benders …
-
Network Design and Analysis Problems in Telecommunication, Location-Allocation, and Intelligent Transportation Systems
… we develop a model and apply the Reformulation-Linearization Technique (RLT) to construct various enhanced tightened versions of the proposed model. We also design efficient Lagrangian dual schemes for solving the linear programming relaxation of the various enhanced models, and construct an …
-
Online and offline algorithms for circuit switch scheduling
… (1- 1/e) approximation ratio. Since the natural linear programming relaxation for the problem has an unbounded integrality gap, we adopt a hybrid approach that combines the combinatorial greedy with randomized rounding of a different suitable linear program. For the online version of the problem, …
-
Combinatorial optimization for graphical structures in machine learning
… to finding the MAP solution is with integer programming. We are interested in analyzing the complexity of integer programming under the assumption that there is a polynomial number of fractional vertices in the linear programming relaxation of the integer program. We show that under this …
-
OPTIMIZING LITTORAL CONNECTOR EMPLOYMENT USING FULLY CONNECTED AND REDUCED NETWORKS
… The latest model reduces these times using a linear programming relaxation, but it still delivers suboptimal results due to network limitations. This research addresses these limitations by proposing network simplification through node and arc reduction and the introduction of virtual arcs to …
-
An efficient implementation of a batch-oriented, multitarget, multidimensional assignment tracking algorithm with application to passive sonar
… (bearings only) from a passive sonar line array. Linear programming relaxation is used to solve the assignment problem for an exhaustive set of measurement-to-track N-tuple costs along the batch. The implementation of the cost evaluations used for the objective function is analyzed for efficiency. …
-
Applications of linear programming to coding theory
… 2003 Feldman and his collaborators defined the linear programming decoder, which operates by solving a linear programming relaxation of the maximum-likelihood decoding problem. As with many modern decoding algorithms, is possible for the linear programming decoder to output vectors that do not …
-
Column generation approaches to bus driver scheduling
… valid duties. This method first solves the Linear Programming relaxation, and then uses Branch and Bound techniques to search for a good integer solution. Improvements to this system are detailed. Most systems which use mathematical programming methods to solve the driver scheduling problem …
-
The mixed-integer bilinear programming problem with extensions to zero-one quadratic programs
… effort is concerned with a class of mathematical programming problems referred to as Mixed-Integer Bilinear Programming Problems. This class of problems, which arises in production, location-allocation, and distribution-application contexts, may be considered as a discrete version of the …
-
Learning to track and identify players from broadcast sports videos
… Random Field. In addition, we propose a novel Linear Programming Relaxation algorithm for predicting the best player identification in a video clip. In order to reduce the number of labeled training data required to learn the identification system, we pioneer the use of weakly supervised …
Page 1 of 4