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 34 for “"IMPLICIT ENUMERATION"”.

  1. An implicit enumeration algorithm for the computer system configuration/expansion problem

    … problem and a method of solution based on the implicit enumeration procedure of Trotter and Shetty [23].</p> <p>By exploiting the special structure of the CSCEP, we have developed a very efficient algorithm. Typically a hardware or software device will provide only one or two types of capacity …

    ut-knoxville Repository record for An implicit enumeration algorithm for the computer system configuration/expansion problem (opens in a new tab)

  2. A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem

    This thesis is concerned with the analysis of a Rectilinear Distance Location Allocation Problem, where the costs are directly proportional to rectilinear distances and the amount shipped. The problem is formulated as a Mixed Integer Bilinear Programming Problem and as a Discrete Location …

    vt Repository record for A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem (opens in a new tab)

  3. An implicit enumeration algorithm employing surrogate constraints for solving linear programs with zero-one variables

    In this paper, an implicit enumeration algorithm is illustrated. Surrogate constraints were used in a special way, to modify and thus obtain) another version of implicit enumeration for solving zero-one problems. For unity and completeness of the paper a brief background is given on the basic ideas …

    rice Repository record for An implicit enumeration algorithm employing surrogate constraints for solving linear programs with zero-one variables (opens in a new tab)

  4. Com- putational Subset Model Selection Algorithms and Applications

    … and needed. To this end, we introduce a new Implicit Enumeration (IE) algorithm and a hybridized IE with the Genetic Algorithm (GA) in this dissertation.</p> <p>The proposed Implicit Enumeration algorithm is the ¯rst algorithm that explicitly uses an information criterion as the objective …

    utk-theses Repository record for Com- putational Subset Model Selection Algorithms and Applications (opens in a new tab)

  5. Data Mining with Multivariate Kernel Regression Using Information Complexity and the Genetic Algorithm

    … <p>Kernel regression is also hybridized with the implicit enumeration algorithm to determine the set of independent variables for the global optimal solution using information criteria as the objective function. The results from the genetic algorithm are compared to the optimal solution from the …

    utk-theses Repository record for Data Mining with Multivariate Kernel Regression Using Information Complexity and the Genetic Algorithm (opens in a new tab)

  6. Tri-level optimization algorithms for solving defender-attacker- defender network models

    … and solution procedures. We develop an implicit enumeration algorithm that incorporates addition of new defenses as an alternative solution method for the DAD model. Our testing demonstrates that implicit enumeration can efficiently generate all equivalent optimal or near-optimal …

    nps Repository record for Tri-level optimization algorithms for solving defender-attacker- defender network models (opens in a new tab)

  7. Uma aplicação de programação inteira: ocupação ótima de uma instalação

    … algorithm for solving the problem through the “Implicit Enumeration” method were developed. Computer programs for the stablishment of these models, as well as routine of Branch and Bound for "MP" solving starting from Simplex Primal were also studied.

    brazil-uerj Repository record for Uma aplicação de programação inteira: ocupação ótima de uma instalação (opens in a new tab)

  8. Optimal routing of battle group VERTREP assets

    … by logistics helicopter. This study describes an implicit enumeration algorithm to schedule the delivery route for a single helicopter. The algorithm employs a depth first search technique to solve the multiple constraint, multiple time window routing problem. Several fathoming techniques are …

    nps Repository record for Optimal routing of battle group VERTREP assets (opens in a new tab)

  9. The mixed-integer bilinear programming problem with extensions to zero-one quadratic programs

    … linearization, a composite Lagrangian relaxation-implicit enumeration-cutting plane algorithm is developed. Extensive computational experience is provided to test the efficiency of various algorithmic strategies and the effects of problem data on the computational effort of the proposed algorithm. …

    vt Repository record for The mixed-integer bilinear programming problem with extensions to zero-one quadratic programs (opens in a new tab)

  10. A multiobjective optimization model for the land allocation problem

    … final allocation. The solution technique uses an implicit enumeration scheme to, iteratively identify efficient solutions. The model and solution technique were implemented in an interactive computer system designed for use by the land use planning professional. The system uses a grid cell …

    ut-knoxville Repository record for A multiobjective optimization model for the land allocation problem (opens in a new tab)

  11. PROJECT SELECTION, SCHEDULING AND RESOURCE ALLOCATION FOR ENGINEERING DESIGN GROUPS

    … prioritization based decomposition heuristic, an implicit enumeration is proposed. This algorithm does not examine all priority sequences, yet guarantees an optimal priority sequence when the computation is completed. Several fathoming rules are proposed to cut back computational time effectively. …

    arizona-thes Repository record for PROJECT SELECTION, SCHEDULING AND RESOURCE ALLOCATION FOR ENGINEERING DESIGN GROUPS (opens in a new tab)

  12. ΜΕΛΕΤΗ ΨΕΥΔΟΜΠΟΥΛΙΑΝΩΝ ΑΝΙΣΟΕΞΙΣΩΣΕΩΝ ΚΑΙ ΣΥΣΤΗΜΑΤΩΝ

    … EQUATION AND INEQUALITY. THREE ALGORITHMS OF IMPLICIT ENUMERATION TYPE ARE DEVELOPED WHICH CREATE THE FAMILY OF SOLUTION OF THESE PROBLEMS. THESE ARE EXPONENTIAL TIME COMPLEXITY PROBLEMS AND FOR THEIR EFFECTIVE RESOLUTION, IT IS NECESSARY TO DEVELOP POWERFUL BOUND CONDITIONS IN THE VERTICES OF …

    greece Repository record for ΜΕΛΕΤΗ ΨΕΥΔΟΜΠΟΥΛΙΑΝΩΝ ΑΝΙΣΟΕΞΙΣΩΣΕΩΝ ΚΑΙ ΣΥΣΤΗΜΑΤΩΝ (opens in a new tab)

  13. Enhanced intersection cutting plane and reformulation-linearization enumeration based approaches for linear complementarity problems

    … The solution strategy developed is a composite impliCit enumeration-Lagrangian relaxation scheme. In addition to the bounds provided by the RLT-based relaxation, we further tighten these bounds at each node of the branch-and-bound tree through the use of strongest surrogate cuts, and …

    vt Repository record for Enhanced intersection cutting plane and reformulation-linearization enumeration based approaches for linear complementarity problems (opens in a new tab)

  14. COMPUTERISED MAINTENANCE SCHEDULING FOR SMALL UTILITIES

    … of computer CPU time required to implement the implicit enumeration algorithm to determine the optimal schedule with the deterministic criteria also indicates the feasibility to apply the maintenance scheduling program on a microcomputer system.

    nus Repository record for COMPUTERISED MAINTENANCE SCHEDULING FOR SMALL UTILITIES (opens in a new tab) Download file for COMPUTERISED MAINTENANCE SCHEDULING FOR SMALL UTILITIES (opens in a new tab)

  15. The optimal design of a physical distribution system on a multicommodity multi-echelon network

    … on distribution center throughput.</p> <p>An implicit enumeration algorithm is presented which uses a heuristic to generate an initial throughput-feasible solution. The algorithm employs a new hybrid price-directive/resource-directive scheme for efficiently solving the multicommodity …

    utk-theses Repository record for The optimal design of a physical distribution system on a multicommodity multi-echelon network (opens in a new tab)

  16. Dynamic Scale Genetic Algorithm: An Enhanced Genetic Search for Discrete Optimization

    … developed here incorporates concepts of implicit enumeration to enhance search. This is achieved by utilizing problem specific information to refine the solution space over successive generations. The utility of the proposed algorithm was demonstrated by comparing its performance, in …

    odu Repository record for Dynamic Scale Genetic Algorithm: An Enhanced Genetic Search for Discrete Optimization (opens in a new tab)

Page 1 of 2