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 11 of 11 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 …
-
Global optimization in reduced space
… which often arise in chemical engineering, and deterministic algorithms such as branch-and-bound provide a certificate of optimality for the identified solution. Unfortunately, the worst-case runtime of these algorithms is exponential in the problem dimension. This leads to the notion of …
-
Operational decisions and learning for multiproduct retail
… on the role of uncertainty in both the seller and the customer decision processes. We begin by considering a logit model framework for personalized revenue management problems where utilities are functions of customer attributes, so that data for any one customer can be generalized to others …
-
Reasoning with imprecise trade-offs in decision making under certainty and uncertainty
… in the presence of multiple, often conflicting and non-commensurate objectives. The process of optimizing systematically and simultaneously over a set of objective functions is known as multi-objective optimization. In multi-objective optimization, we have a (possibly exponentially large) set of …
-
Algorithms, analysis and software for the global optimization of two-stage stochastic programs
… parameters due to uncertainties in market forces and the environment, use of reduced-order and surrogate process models, and difficulty in measuring parameters accurately. Optimal solutions to formulations that simply ignore uncertainties in the model parameters can be economically worthless or …
-
Advances in Computer-Assisted Design and Analysis of First-Order Optimization Methods and Related Problems
First-order methods are optimization algorithms that can be described and analyzed using the values and gradients of the functions to be minimized. These methods have become the main workhorses for modern large-scale optimization and machine learning due to their low iteration costs, minimal memory …
-
Discrete and Continuous Nonconvex Optimization: Decision Trees, Valid Inequalities, and Reduced Basis Techniques
This dissertation addresses the modeling and analysis of a strategic risk management problem via a novel decision tree optimization approach, as well as development of enhanced Reformulation-Linearization Technique (RLT)-based linear programming (LP) relaxations for solving nonconvex polynomial …
-
Optimization Models and Analysis of Routing, Location, Distribution, and Design Problems on Networks
… problems arising in the context of public supply and commercial transportation, emergency response and risk management, engineering design, and industrial planning are addressed in this study. The decisions to be made in these problems include the location of supply centers, the routing, …
-
ΕΠΙΛΥΣΗ ΠΡΟΒΛΗΜΑΤΩΝ ΧΩΡΟΘΕΤΗΣΗΣ ΚΕΝΤΡΩΝ ΠΑΡΟΧΗΣ ΥΠΗΡΕΣΙΩΝ ΣΕ ΔΙΚΤΥΟ
… LOCATION PROBLEM (FLP) IN SUCH WAY THAT ANY DEMAND POINT CAN BE SERVICED BY A FLP IN A TIME-DISTANCE LESS THAN A GIVEN T (PROBLEM (F)). PROBLEM (F) BELONGS TO THE WELL KNOWN CATEGORY OF NP-HARD PROBLEMS AND UNTIL NOW IT IS TACKLED UNDER THE FRAMEWORK OF THESET COVERING PROBLEM (SCP). IN THIS …