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 314 for “"integer linear program"”.

  1. An integer linear program to schedule an Army installation's maneuver training

    This thesis develops an integer linear program called MSAMT (Model to Schedule Army Maneuver Training) to schedule an Army installation's maneuver training. We demonstrate MSAMT using a data set containing 261 platoon-level, 67 company-level and 18 battalion-level units, and 7 major training areas …

    nps Repository record for An integer linear program to schedule an Army installation's maneuver training (opens in a new tab)

  2. An integer linear program to combine container handling and yard crane deployment

    … container terminal. This thesis establishes an Integer Linear Program (ILP) to combine container handling and yard crane deployment for Rubber Tired Gantry Cranes (RTG). Using real world data, we test the ILP for two different yard sizes. We find the resulting ILPs difficult to solve directly. …

    nps Repository record for An integer linear program to combine container handling and yard crane deployment (opens in a new tab)

  3. FINITE DISJUNCTIVE PROGRAMMING METHODS FOR GENERAL MIXED INTEGER LINEAR PROGRAMS

    … dissertation, a finitely convergent disjunctive programming procedure, the Convex Hull Tree (CHT) algorithm, is proposed to obtain the convex hull of a general mixed–integer linear program with bounded integer variables. The CHT algorithm constructs a linear program that has the same optimal …

    arizona-thes Repository record for FINITE DISJUNCTIVE PROGRAMMING METHODS FOR GENERAL MIXED INTEGER LINEAR PROGRAMS (opens in a new tab)

  4. RUNTIME ANALYSIS OF BENDERS DECOMPOSITION AND DUAL ILP ALGORITHMS AS APPLIED TO COMMON NETWORK INTERDICTION PROBLEMS

    … algorithms, Benders decomposition and a dual integer linear program approach, to compare their computational efficiency on the shortest path and maximum flow interdiction problems. We construct networks using two operationally meaningful structures: a grid structure designed to represent an …

    nps Repository record for RUNTIME ANALYSIS OF BENDERS DECOMPOSITION AND DUAL ILP ALGORITHMS AS APPLIED TO COMMON NETWORK INTERDICTION PROBLEMS (opens in a new tab)

  5. Largest 2-regular Subgraphs in Complete S-partite Graphs

    … of these graphs, which can be formulated as an integer linear program. Roughly speaking, a complete $S$-partite graph is obtained by replacing every single node of $S$ with a number of nodes, preserving the edge/non-edge relations of $S$. Our motivation in studying largest $2$-regular subgraphs …

    wustl Repository record for Largest 2-regular Subgraphs in Complete S-partite Graphs (opens in a new tab)

  6. Survivable Overlay Layout of IP Over WDM

    … dealing with any single fiber cut as a Mixed Integer Linear Program (MILP), which is a modified version of the Integer Linear Program (ILP) in [1]. We route various IP networks over a number of WDM networks to show the dramatic run-time improvement of this MILP compared to the ILP in [1]. We …

    hawaii Repository record for Survivable Overlay Layout of IP Over WDM (opens in a new tab)

  7. Allocating flight hours to Army helicopters

    … using optimization; it develops both a mixed integer linear program and a quadratic program. The 2nd Battalion, 4th Aviation Regiment of 4th Mechanized Division currently uses a spreadsheet implementation of the quadratic program developed by the author called QFHAM (Quadratic Flight Hour …

    nps Repository record for Allocating flight hours to Army helicopters (opens in a new tab)

  8. Improving the Army's joint platform allocation tool (JPAT)

    … joint platform allocation tool (JPAT) is an integer linear program that was developed by the Army's Training and Doctrine Command Analysis Center and the Naval Postgraduate School to help inform acquisition decisions involving aerial reconnaissance and surveillance (R&S) resources. JPAT …

    nps Repository record for Improving the Army's joint platform allocation tool (JPAT) (opens in a new tab)

  9. Analysis of inventory lot size problem

    … backordering and holding costs, as zero-one integer linear program. Also, the problem is modeled as piece wise integer linear program by incorporating quantity discounts. Furthermore, we consider such a problem, with ambiguous variable demand to be satisfied as closely as possible. Therefore …

    manitoba Repository record for Analysis of inventory lot size problem (opens in a new tab)

  10. Optimization tools for process planning

    … can be formulated as a multiperiod, mixed-integer linear program (MILP). This MILP can then be reformulated by exploiting lot sizing substructures. While the reformulation produces a tight linear programming relaxation, it also introduces a large number of variables and constraints.

    uiuc Repository record for Optimization tools for process planning (opens in a new tab)

  11. Global Optimization in Systems Biology and Bioinformatics

    … In this thesis, the problem is modeled as an integer linear program with weak assumptions on the binding pattern. A computationally efficient formulation and linearization scheme is developed and the resulting problem is solved to global optimality. The proposed formulation successfully solved …

    uiuc Repository record for Global Optimization in Systems Biology and Bioinformatics (opens in a new tab)

  12. Models for conducting economic analysis of alternative fuel vehicles.

    … model is formulated for each vehicle type. An integer linear program is derived and explained as a means of determining the optimal mix of vehicles for a command's transportation fleet. The models are tested by running several test cases using data from the Naval Postgraduate School …

    nps Repository record for Models for conducting economic analysis of alternative fuel vehicles. (opens in a new tab)

  13. Foundation Models for Optimization and Automation in Network Management

    … in mathematical optimization, solver-level programming, and domain toolchains that practitioners able to express intent in natural language rarely possess. General-purpose tools do not encode the domain vocabulary, API conventions, or validation criteria required for reliable automation, and …

    queens Repository record for Foundation Models for Optimization and Automation in Network Management (opens in a new tab)

  14. An intelligent optimization system for terminal traffic management

    … and takes advantage of the self-contained mixed integer linear program. The mixed integer linear program calculates the optimal schedule for each aircraft for each runway while the intelligent optimization method is used to produce optimal runway assignment for all flights in the entire airport. …

    umn Repository record for An intelligent optimization system for terminal traffic management (opens in a new tab)

  15. Downlink Traffic Scheduling in Green Vehicular Roadside Infrastructure

    … scheduling is then formulated as a Mixed Integer Linear Program (MILP). Following this, three energy efficient online scheduling algorithms with varying complexity are introduced. Results from a variety of experiments show that the proposed scheduling algorithms perform well when compared …

    mcmaster Repository record for Downlink Traffic Scheduling in Green Vehicular Roadside Infrastructure (opens in a new tab)

  16. ASSESSING THE IMPACT OF CONGESTION DURING A MULTI-COUNTY EVACUATION

    This thesis introduces an integer linear program called the Minimum Cost Flow with Congestion Assignment (MCF-CA) model. MCF-CA is a multi-period evacuation model that uses a novel approach called congestion assignment to analyze clearing times during mass evacuations. Congestion assignment …

    nps Repository record for ASSESSING THE IMPACT OF CONGESTION DURING A MULTI-COUNTY EVACUATION (opens in a new tab)

  17. Bounding the Convex Hull Relaxation of the Unit Commitment Problem with the Shapley-Folkman Theorem

    … The UC problem is often modeled with a mixed-integer linear program (MILP). We employ the Shapley-Folkman Theorem to provide a bound on the size of fractional solutions of its convex hull relaxation. This result is used to obtain a bound on the optimality gap between the MILP and the convex …

    clemson Repository record for Bounding the Convex Hull Relaxation of the Unit Commitment Problem with the Shapley-Folkman Theorem (opens in a new tab)

  18. Minimization of blending losses to determine optimal standard enrichments of nuclear fuel

    … such as the gas centrifuge. Using a mixed-integer linear program, the model minimizes present worth costs for a 39-product-enrichment reference case. For four ingredients, the marginal blending cost is only 0.18 percent of the total direct production cost. Natural uranium is not an optimal …

    vt Repository record for Minimization of blending losses to determine optimal standard enrichments of nuclear fuel (opens in a new tab)

  19. Integer Programming

    Mathematical programming problems in which all variables can assume nonnegative integer values only are called pure integer programming problems. If in the absence of the integrality conditions the objective and constraint functions are linear, the resulting model is called an integer linear …

    marquette Repository record for Integer Programming (opens in a new tab)

Page 1 of 16