Now showing items 1-5 of 5
A Branch-and-Cut Algorithm based on Semidefinite Programming for the Minimum k-Partition Problem
(University of Waterloo, 2007-04-20)
The minimum k-partition (MkP) problem is a well-known optimization problem encountered in various applications most notably in telecommunication and physics. Formulated in the early 1990s by Chopra and Rao, the MkP ...
New Conic Optimization Techniques for Solving Binary Polynomial Programming Problems
(University of Waterloo, 2011-08-26)
Polynomial programming, a class of non-linear programming where the objective and the constraints are multivariate polynomials, has attracted the attention of many researchers in the past decade. Polynomial programming is ...
A Semidefinite Programming Model for the Facility Layout Problem
(University of Waterloo, 2010-08-30)
The continuous facility layout problem consists of arranging a set of facilities so that no pair overlaps and the total sum of the pairwise connection costs (proportional to the center-to-center rectilinear distance) is ...
A Robust Optimization Approach to the Self-scheduling Problem Using Semidefinite Programming
(University of Waterloo, 2010-01-21)
In deregulated electricity markets, generating companies submit energy bids which are derived from a self-schedule. In this thesis, we propose an improved semidefinite programming-based model for the self-scheduling problem. ...
Cutting-Plane Separation Strategies for Semidefinite Programming Models to Solve Single-Row Facility Layout Problems
(University of Waterloo, 2008-10-27)
The single-row facility layout problem (SRFLP) is concerned with finding the optimal linear placement of n departments with different lengths in a straight line. It is typically achieved by minimizing the cost associated ...