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 156 for “"branch-and-bound algorithm"”.

  1. Data-driven Spatial Branch-and-bound Algorithm

    … simulation models are used routinely in chemical and other engineering and science disciplines to explain complex underlying phenomena. Solving optimization formulations with embedded computer simulations is of high interest since it bridges the gap between multi-fidelity and multiscale knowledge …

    gatech Repository record for Data-driven Spatial Branch-and-bound Algorithm (opens in a new tab)

  2. 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 …

    nps Repository record for A branch-and-bound algorithm for the network diversion problem (opens in a new tab)

  3. A branch and bound algorithm for the delivery truck problem

    … which includes both the weight of the packages and the amount of fuel remaining in the tank. The problem is to determine a sequence in which to deliver all m packages which will minimize total fuel consumption. A branch and bound algorithm for obtaining optimal solutions to the delivery truck …

    nps Repository record for A branch and bound algorithm for the delivery truck problem (opens in a new tab)

  4. A parallel branch and bound algorithm for integer linear programming models

    "A parallel branch and bound algorithm is developed for use with MIMD computers to study the efficiency of parallel processors on general integer linear programming problems. The Haldi and IBM test problems and a System Design model are used in the implementation of the algorithm. Initially the …

    must-thes Repository record for A parallel branch and bound algorithm for integer linear programming models (opens in a new tab)

  5. An exact branch and bound algorithm for the general quadratic assignment problem

    … is concerned with the development of an exact algorithm for a general quadratic assignment problem (QAP), of which the Koopmans-Beckmann formulation, in the context of an analysis of the location of economic activities or facilities, is a special case. The algorithm is based on the …

    ttu Repository record for An exact branch and bound algorithm for the general quadratic assignment problem (opens in a new tab)

  6. Parallelization of a Maximum Parsimony Branch and Bound Algorithm for Phylogenetic Inference

    … relationships among species in the form of branching diagrams called trees. Specifically, certain biological structures common to all living organisms, such as morphological characteristics, protein sequences or DNA sequences can be compared Differences and similarities in these …

    rit Repository record for Parallelization of a Maximum Parsimony Branch and Bound Algorithm for Phylogenetic Inference (opens in a new tab)

  7. A branch-and-bound algorithm for the solution of sequence dependent routing problems

    A branch-and-bound algorithm, which finds the optimal route through n nodes when a different cost matrix occurs after each arc in the sequence is traversed, is presented. The route may begin at any node and must pass through each of the n nodes exactly once. The objective is to minimize total cost …

    nps Repository record for A branch-and-bound algorithm for the solution of sequence dependent routing problems (opens in a new tab)

  8. A SEMI-DEFINITE RELAXATION BRANCH-AND-BOUND ALGORITHM FOR BINARY INTEGER QUADRATIC PROBLEMS USING SCIPSUITE

    … Optimization Problem is a classical problem and studied in many fields. Typical applications include the 0-1 Quadratic Problem (QP), the Maximum Cut Problem (MAXCUT), k-Cluster Problem (kCluster), Maximum Independent Set Problem (MIS) as well as the Exact k-Quadratic Knapsack Problems …

    nus Repository record for A SEMI-DEFINITE RELAXATION BRANCH-AND-BOUND ALGORITHM FOR BINARY INTEGER QUADRATIC PROBLEMS USING SCIPSUITE (opens in a new tab) Download file for A SEMI-DEFINITE RELAXATION BRANCH-AND-BOUND ALGORITHM FOR BINARY INTEGER QUADRATIC PROBLEMS USING SCIPSUITE (opens in a new tab)

  9. A computer program for solution of sequence dependent routing problems using a branch-and-bound algorithm.

    An algorithm for the solution of sequence-dependent routing problems is presented and programmed in FORTRAN IV for use on digital computers. Solutions, computation times and iteration requirements are summarized and discussed for eleven test cases. With specific modification of the input data, a …

    nps Repository record for A computer program for solution of sequence dependent routing problems using a branch-and-bound algorithm. (opens in a new tab)

  10. 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 …

    mcmaster Repository record for Single Machine Total Weighted Tardiness With Release Dates (opens in a new tab)

  11. The solution of a class of limited diversification portfolio selection problems

    A branch-and-bound algorithm for the solution of a class of mixed-integer nonlinear programming problems arising from the field of investment portfolio selection is presented. The problems in this class are characterized by the inclusion of the fixed transaction costs associated with each asset, a …

    rice Repository record for The solution of a class of limited diversification portfolio selection problems (opens in a new tab)

  12. 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 …

    vt Repository record for A decomposition procedure for finding the minimal Hamiltonian chain of a sparse graph (opens in a new tab)

  13. Solving Combinatorial Optimization Problems using Statistical Learning

    … to the capacitated vehicle routing problem and the bin packing problem—which have non-deterministic polynomial computational complexity. The core idea is based on learning to approximate the decisions made by the branch and bound algorithm using the computationally expensive strong branching …

    uvic Repository record for Solving Combinatorial Optimization Problems using Statistical Learning (opens in a new tab)

  14. Global Optimization in Least Squares Problems in FTIR Spectroscopy and X -Ray Crystallography

    … we develop novel optimization formulations and algorithms that exploit the special model structure of the problem. For the case of centrosymmetric structures, we first formulate the problem as a 0--1 linear programming problem and suggest a branch-and-bound algorithm for solving it. Based on …

    uiuc Repository record for Global Optimization in Least Squares Problems in FTIR Spectroscopy and X -Ray Crystallography (opens in a new tab)

  15. Flow shop scheduling with two machines

    … (i = 1.. , n) on m machines (j = 1, . . . , m) and a job consists two operations and the jth operation of each job must be processed on machine j. Any job can start only on machine j if it is completed on machine j-1 and if machine j is free. Each operation has a known processing time pij. The …

    unlv Repository record for Flow shop scheduling with two machines (opens in a new tab) Download PDF for Flow shop scheduling with two machines (opens in a new tab)

  16. Global optimization using interval constraints

    … to accuracy: those with guaranteed accuracy and those without. The former are called bounding methods, the latter point methods. Bounding methods compute lower and upper bounds of function over a box and give a lower bound and an upper bound for the minimum. Point methods compute function …

    uvic Repository record for Global optimization using interval constraints (opens in a new tab)

  17. Robust Nonlinear Control Using Bilinear Matrix Inequalities With Application to a Batch Crystallization Process

    … problem, has been shown to be NP-hard, and its efficient solution is also an open research problem. Various solution strategies have been incorporated to a branch and bound algorithm solving the aforementioned optimization problem, and were compared for various controller designs.

    uiuc Repository record for Robust Nonlinear Control Using Bilinear Matrix Inequalities With Application to a Batch Crystallization Process (opens in a new tab)

Page 1 of 8