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 49 for “"Branch and bound algorithms"”.
-
New methods for branch-and-bound algorithms
Branch-and-bound (B&B) algorithms, and extensions such as branch-and-price (B&P) are powerful tools for optimization. These algorithms are used in a wide variety of settings, and thus it is beneficial to develop new techniques to improve the performance of B&B algorithms that are independent of the …
-
Cyclic best first search in branch-and-bound algorithms
… called cyclic best first search (CBFS) in branch-and-bound (B&B) algorithms. First, we solve a one machine scheduling problem with release and delivery times with the minimum makespan objective with a B&B algorithm using a variant of CBFS called CBFS-depth and a modified heuristic for …
-
ON LARGE-SCALE SDPS AND THEIR APPLICATIONS ON BRANCH-AND-BOUND ALGORITHMS FOR BINARY QCQPS AND QAPS
We present a semidefinite programming (SDP) based branch-and-bound (BnB) solver for binary and quadratically constrained quadratic programming (QCQP) problems and particularly, quadratic assignment problems (QAPs). We begin by introducing a multi-clique augmented Lagrangian-based SDP solver that …
-
Hierarchiniai lygiagretieji šakų ir rėžių algoritmai heterogeninėms skaičiavimų sistemoms /
Hierarchical Parallel Branch-and-Bound Algorithms for Heterogeneous High Performance Systems.
-
Algorithms for Multi-Sample Cluster Analysis
<p>In this study, we develop algorithms to solve the Multi-Sample Cluster Analysis (MSCA) problem. This problem arises when we have multiple samples and we need to find the statistical model that best fits the cluster structure of these samples. One important area among others in which our …
-
Branching Rules for Minimum Congestion Multi-Commodity Flow Problems
In this paper, we examine various branch and bound algorithms for a minimum congestion origin-destination integer multi-commodity flow problem. The problem consists of finding a routing such that the congestion of the most congested arc is minimum. For our implementation, we assume that all demands …
-
Exact and heuristic methods for heterogeneous assembly line balancing problems of type 2.
… the task. In the Assembly Line Worker Assignment and Balancing Problem (ALWABP), workers are assigned to workstations and according to their abilities, they execute tasks in different amounts of time. In some cases they can even be incapable of executing some tasks. In the Robotic Assembly Line …
-
On sequencing ordered matrix flowshop problems
… into three broad categories; flowshop, job shop, and general sequencing. These categories are based on the job routing patterns in a shop. Within the flowshop category Smith [11] has defined subcategories, two of which are called "ordered matrix" and "semiordered matrix problem". This research is …
-
Bound tightening to improve branch-and-bound mixed-integer programming
Includes bibliographical references.
-
A branch-and-bound algorithm for the network diversion problem
… edges in a diversion set ED . We develop and test a specialized branch-and-bound algorithm for this NP-complete problem. The algorithm is based on partitioning the solution space with respect to edges in certain s-t cuts and yields a nonstandard, non-binary enumeration tree. The algorithm …
-
Com- putational Subset Model Selection Algorithms and Applications
… develops new computationally e±cient algorithms for identifying the subset of variables that minimizes any desired information criteria in model selection.</p> <p>In recent years, the statistical literature has placed more and more empha- sis on information theoretic model selection …
-
Efficient parallel algorithms and data structures for discrete-event simulation
… which is a major tool for analysis, prediction, and training, has been demanding increasingly high computational resources. It has continued to defy an efficient parallel solution. A long-st anding serial bottleneck in parallelizing event-driven simulation ,va.s the shared data structure - …
-
A Closed Form Optimization Model for The Conflict Neutralization Problem
… for the Conflict Neutralization Problem (CKP) and implemented an efficient algorithm for solving the problem. A novel tableau representation of the CNP model was presented and described in detail. We implemented a special structured branch and bound algorithm to solve the problem. Key …
-
Method to reduce computer running time for the integer programming lockbox problem, A
Includes bibliographical references.
-
Optimal Task Scheduling for Parallel Systems using State-Space Search
… are each allocated to a specific processor and in a specific order which minimises the overall run-time. This problem is NP-hard, so that the amount of work required grows exponentially as the number of tasks is increased. Although the NP-hardness of the problem usually discourages optimal …
Page 1 of 3