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 188 for “"Branch-and-Bound"”.
-
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 …
-
Order-Leading Branch and Bound for Neural Network Verification
Certifying the correctness, robustness, and safety of deep neural networks has become a pressing imperative. Despite their ubiquitous deployment in image classification, software engineering, and bug detection, the field still lacks rigorous methodologies to verify their behavior. Although …
-
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 …
-
Bound tightening to improve branch-and-bound mixed-integer programming
Includes bibliographical references.
-
Long-horizon motion planning with branch-and-bound and neural dynamics
Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2026-12-01
-
Long-horizon motion planning with branch-and-bound and neural dynamics
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms
-
Semidefinite relaxation based branch-and-bound method for nonconvex quadratic programming
… thesis, we use a semidefinite relaxation based branch-and-bound method to solve nonconvex quadratic programming problems. Firstly, we show an interval branch-and-bound method to calculate the bounds for the minimum of bounded polynomials. Then we demonstrate four SDP relaxation methods to solve …
-
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 …
-
Optimal temporal planning at reactive time scales via dynamic backtracking branch and bound
… roles in our society, such as urban search and rescue, automation for assisted living, and lunar habitat construction. To fulfill these roles, teams of autonomous robots will need to cooperate together to accomplish complex mission objectives in uncertain and dynamic environments. In these …
-
Hybrid artificial bee colony algorithm with branch and bound for two–sided assembly line balancing
… it was considered as a very useful, effective and well-known algorithm. Nevertheless, the ABC is also known to be a slow converging method in achieving an optimal solution. This research is intended to improve the ABC performance in solving the 2SALB problem with the objectives to hybrid ABC …
-
Enabling massive parallelism for two-stage stochastic integer optimizations a branch and bound based approach
… provides huge opportunity for improvement and commensurate cost savings. Stochastic optimization techniques are used to incorporate uncertainty in the data to arrive at robust resource allocations. The application of stochastic optimization extends to a broad range of areas ranging from …
-
A linear constraint driven approach to efficiently enhancing branch and bound in neural network verification
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms
-
A parallel branch-and-bound algorithm for thin-film optical systems, with application to realizing a broadband omnidirectional antireflection coating for silicon solar cells
… systems, this thesis work develops a parallel branch-and-bound computational system on Amazon's EC2 platform, using the Taylor model mathematical/computational system due to Berz and Makino to construct tight rigorous bounds on the merit function on subsets of the search space (as required by a …
-
An integrated approach to the optimal sequencing of robot operations in a workcell
… A robot transports jobs from buffers to machines and from machines to buffers. The robots used in the system are 5 jOint cylindrical coordinate robots. All the robots are identical in design and capability. For the type of robot used in this study its closed form inverse kinematic solution is …
-
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 …
-
Search State Extensibility based Learning Framework for Model Checking and Test Generation
The increasing design complexity and shrinking feature size of hardware designs have created resource intensive design verification and manufacturing test phases in the product life-cycle of a digital system. On the contrary, time-to-market constraints require faster verification and test phases; …
-
A decomposition procedure for finding the minimal Hamiltonian chain of a sparse graph
… a large problem into several smaller problems and uses a branch and bound algorithm to find the minimal Hamiltonian chain of each partitioned subproblem. The graph is decomposed and partitioned into subproblems with the use of necessary conditions for the existence of a Hamiltonian chain. This …
Page 1 of 10