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 287 for “"Integer Programming"”.

  1. Integer Programming With Groebner Basis

    Integer Programming problems are difficult to solve. The goal is to find an optimal solution that minimizes cost. With the help of Groebner based algorithms the optimal solution can be found if it exists. The application of the Groebner based algorithm and how it works is the topic of research. The …

    vcu Repository record for Integer Programming With Groebner Basis (opens in a new tab)

  2. A Generalized Inverse Approach to Integer-Programming

    Made available in DSpace on 2014-12-10T23:09:03Z (GMT). No. of bitstreams: 1 7414645.pdf: 1571801 bytes, checksum: 5813da2de229103986aa4d852704fb64 (MD5) Previous issue date: 1974

    uiuc Repository record for A Generalized Inverse Approach to Integer-Programming (opens in a new tab)

  3. Xqx Based Modeling For General Integer Programming Problems

    We present a new way to model general integer programming (IP) problems with in- equality and equality constraints using XQX. We begin with the definition of IP problems folloby their practical applications, and then present the existing XQX based models to handle such problems. We then present our …

    mississippi Repository record for Xqx Based Modeling For General Integer Programming Problems (opens in a new tab)

  4. Enhanced Mixed Integer Programming Techniques and Routing Problems

    Mixed integer programming is up today one of the most widely used techniques for dealing with hard optimization problems. On the one side, many practical optimization problems arising from real-world applications (such as, e.g., scheduling, project planning, transportation, telecommunications, …

    bologna Repository record for Enhanced Mixed Integer Programming Techniques and Routing Problems (opens in a new tab)

  5. Strategic Planning Under Uncertainty: Stochastic Integer Programming Approaches

    In the final part of this thesis, we address a class of stochastic programs with discrete first stage decisions and decision-dependent uncertainties. These problems are formulated as 0--1 hyperbolic programs for which we use the theory of convex extensions to develop a reformulation scheme and an …

    uiuc Repository record for Strategic Planning Under Uncertainty: Stochastic Integer Programming Approaches (opens in a new tab)

  6. Integer Programming Heuristics for Large Capital Budgeting Problems

    … matter of this thesis was the comparison of five integer algorithms suitable for solving large capital budgeting problems such as those characterized by the national development plans in developing nations. In order to obtain statistically meaningful results, we designed and carried out some …

    uiuc Repository record for Integer Programming Heuristics for Large Capital Budgeting Problems (opens in a new tab)

  7. Application of mixed-integer programming in chemical engineering

    Mixed-Integer Programming has been a vital tool for the chemical engineer in the recent decades and is employed extensively in process design and control. This dissertation presents some new Mixed-Integer Programming formulations developed for two well-studied problems, one with a central role in …

    cambridge Repository record for Application of mixed-integer programming in chemical engineering (opens in a new tab)

  8. Evaluating robustness of neural networks with mixed integer programming

    … of piecewise-linear neural networks as a mixed integer program. Our verifier finds minimum adversarial distortions two to three orders of magnitude more quickly than the state-of-the-art. We achieve this via tight formulations for non-linearities, as well as a novel presolve algorithm that makes …

    mit Repository record for Evaluating robustness of neural networks with mixed integer programming (opens in a new tab)

  9. Advanced mixed-integer programming formulations : methodology, computation, and application

    … thesis introduces systematic ways to use mixed-integer programming (MIP) to solve difficult nonconvex optimization problems arising in application areas as varied as operations, robotics, power systems, and machine learning. Our goal is to produce MIP formulations that perform extremely well in …

    mit Repository record for Advanced mixed-integer programming formulations : methodology, computation, and application (opens in a new tab)

  10. An integer programming formulation for the music school timetabling problem

    … when done manually. The results show that an integer programming model with a two phase model approach can be used to solve the music school timetabling problem, creating a feasible schedule for a music school were students and teachers are assigned to right courses.

    reykjavik Repository record for An integer programming formulation for the music school timetabling problem (opens in a new tab)

  11. An integer programming clustering approach with application to recommendation systems

    … on finding clusters of similar customers using integer programming model which is to find the minimal number of clusters subjected to several similarity measures. The proposed recommendation method is compared with collaborative filtering, and the experimental results show that it provides …

    iastate Repository record for An integer programming clustering approach with application to recommendation systems (opens in a new tab)

  12. Bound tightening to improve branch-and-bound mixed-integer programming

    Includes bibliographical references.

    colo-mines Repository record for Bound tightening to improve branch-and-bound mixed-integer programming (opens in a new tab)

  13. Advancing mixed-integer programming using data-driven and deduction-based methods

    Mixed-Integer Problems (MIPs) form one of the most general classes of optimization problems. As they are used to model many real-world scenarios, solving MIPs efficiently is crucial. Most solvers are based on the well-known Branch-and-Bound algorithm, which utilizes different subroutines to help …

    tu-berlin Repository record for Advancing mixed-integer programming using data-driven and deduction-based methods (opens in a new tab)

  14. AN INTEGER PROGRAMMING MODEL FOR DYNAMIC TAXI-SHARING CONSIDERING PROVIDER PROFIT

    This thesis proposes an integer programming model for Dynamic Taxi-Sharing (DTS), which allows two groups of taxi users to ride on the same taxi together. The model matches taxi drivers and user pairs in certain sequences with the goal of maximizing taxi providers’ profit. We also develop a DTS …

    maryland Repository record for AN INTEGER PROGRAMMING MODEL FOR DYNAMIC TAXI-SHARING CONSIDERING PROVIDER PROFIT (opens in a new tab)

  15. Combining heuristics and integer programming for optimizing job shop scheduling models

    Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.

    mit Repository record for Combining heuristics and integer programming for optimizing job shop scheduling models (opens in a new tab)

Page 1 of 15