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 50 for “"Branch-and-bound method"”.
-
A constraint branch-and-bound method for set partitioning problems
… thesis compares the efficiency of a constraint branch-and-bound method against the conventional variable branch-and-bound method in solving set partitioning problems. Because of the difficulties encountered in writing the constraint branch-and-bound subroutine, it was necessary to solve each …
-
Novel Analysis of the Branch-and-Bound Method for Integer Programming
… become a pillar of operational decision making and optimization, with large-scale economic and societal impact. MILP solvers drive multi-billion dollar industries and the operation of critical infrastructure, and this ability to use MILPs to effectively make large-scale discrete decisions relies …
-
A Branch and Bound Method for Sum of Completion Permutation Flow Shop
We present a new branch and bound algorithm for solving three machine permutation flow shop problem where the optimization criterion is the minimization of sum of completion times of all the jobs. The permutation flow shop problem (F||∑Ci ) belongs to the class of NP-hard problems; finding the …
-
Some Computational Aspects of the Branch and Bound Method for Integer Programs
Different heuristics for the branch and bound method are tested on capital budgeting type integer programming problems. The standard up and down penalties are compared with Tomlin's improved penalties. The use of the 'priority order' derived from the objective coefficients is also examined. A new …
-
Pseudo-Boolean Programming for Bivalent Optimization
… bivalent optimization problems with linear and nonlinear constraints. This method is a combination of the algorithm suggested by Hammer and the branch and bound method. The whole system of constraints is replaced by a single Boolean resolvent function and the solutions of this resolvent are …
-
Job Shop Scheduling with Flexible Maintenance Planning
… include the scheduling of jobs with both soft and hard due dates, and the integration of maintenance planning with job scheduling. Two variants of the scheduling problem are considered: The first variant makes the classic job shop assumption of infinite queueing capacity at each machine, while …
-
FIXED ORDER BRANCH AND BOUND METHODS FOR MIXED-INTEGER PROGRAMMING.
… heuristic solution can find improved solutions and reduce the error estimate as quickly as possible. This is achieved by using two ideas: a fixed order branch-and-bound method with selective expansion of subproblems and the sieve strategy which uses stronger than optimal bounds. The fixed order …
-
Ellipsoidal approximation to polytopes and computational study of Lenstra's algorithm
… are ellipsoidal approximation of polytopes and lattice basis reduction. However, the lack of practically efficient algorithms and software for the ellipsoidal approximation of polytopes has made it difficult to study the computational properties of Lenstra's algorithm. To bridge the gap …
-
Real-Time Adaptive Scalable Texture Compression for the Web
… utilization in web browsers. A fast encoding method that uses heuristics and avoids the commonly used branch and bound method is presented. Performance benchmarks and quality comparisons against other commonly used encoders show that it is possible to compress textures with reasonable quality …
-
Contemporary Approaches to the Solution of the Integer Programming Problem
… provide analysis of the modem development 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 …
-
Formulation and implementation of a large-scale work scheduling algorithm for underground coal mines.
… on a shift basis is one of the most important and difficult decisions for the managers of underground coal mines. The objective of this study was to develop a work scheduling algorithm to handle the worker assignment problem in an efficient and practical way. The study basically consisted of …
-
A two-directional target optimization model.
… force. The basis of the algorithm is the branch and bound method, with upper bounds computed by dynamic programming. Several variations are considered, such as payload limit, an increased number of aircraft from each direction, and a three-directional attack. An example problem is solved …
-
Optimally Locating Facilities with Variable Characteristics
… or minimizing the costs of locating facilities and serving the customers. In this thesis, we mainly focus on competitive facility location problems which constitute a special family. In a competitive facility location problem, a firm or franchise is concerned with installing new facilities to …
-
Algorithms for solving linear integer progamming problems
<p>This thesis discusses several methods used to solve linear integer programming problems. Chapters 1-3 give the necessary linear programming background. Chapter 4 introduces integer programming and describes, in general, the two classes of solution methods -enumeration and cutting planes. Chapter …
-
Search algorithms for the simple plant location problem
… algorithm which is developed is similar to the Branch and Bound method. The approximate technique consists of a directed search through the solution tree for the problem, followed by terminal iterations. The terminal iterations are justified by empirical results obtained from a preliminary …
-
Combining Node and Variable Selection Heuristics for Faster MIP Solutions
The Node selection (NS) and variable and direction selection (VDS) heuristics significantly affect the time to find the MIP integer-optimal solution when using branch and bound method. In this thesis, various variable and direction selection methods are tested coupled with the node selection …
-
Point cover problem in 3D
… the point cover problem. We study the Lift-and-Project relaxation of the standard IP to obtain lower bounds. This method is used to strengthen the integrality gap of a problem. Our experimental results show that the Lagrangian relaxation method gives very good lower bounds at reasonable …
-
Single Machine Total Weighted Tardiness With Release Dates
… known to be strongly NP-hard. With a new lower bounding scheme and a new upper bounding scheme, we get an efficient branch and bound algorithm. In the paper, we first introduce the history of the problem and its computational complexity. Second, the lower bounding schemes and the upper bounding …
-
Efficient algorithms for the fixed charge problem
… to arrive at the final solution. Although this method starts with an approximated version of the fixed charge component, it arrives at an exact value to the objective function without the need for re-evaluating the objective function. The other three solution procedures are based on …
-
New algorithms for pathwidth computation
The notions of pathwidth and the closely related treewidth have become more and more important recently. The importance lies not only in theory but also in practice. Theoretically, lots of NP-hard problems become polynomially solvable when restricted in graphs with bounded pathwidth (or treewidth). …
Page 1 of 3