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 1423 for “"Integer programming"”.

  1. 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)

  2. Distributed integer programming

    In this thesis, we study distributed integer programming problems that involve multiple players with integer programming problems linked together with a common resource constraint. Our goal is to design decentralized algorithms that do not require a central processor to allocate the resource across …

    gatech Repository record for Distributed integer programming (opens in a new tab)

  3. Integer programming with Gröbner bases and applications to multiobjective integer programming

    Integer programming and its multiobjective variants are important NP-hard problems with applications in graph theory, scheduling, logistics and decision making, among others. One approach to solving these classes of optimization problems that is underexplored in the literature is the algebraic …

    brazil-ufrgs Repository record for Integer programming with Gröbner bases and applications to multiobjective integer programming (opens in a new tab)

  4. Sparsity in integer programming

    … explored direction of research in the context of Integer Programming. Harnessing the sparsity present in the underlying linear relaxation, using decomposition/reformulation techniques and complexity results for approximation algorithms correspond to most of the previous results in this area. In …

    gatech Repository record for Sparsity in integer programming (opens in a new tab)

  5. Integer programming based search

    When integer programming (IP) models are used in operational situations there is a need to consider the tradeoff between the conflicting goals of solution quality and solution time, since for many problems solving realistic-size instances to a tight tolerance is still beyond the capability of …

    gatech Repository record for Integer programming based search (opens in a new tab)

  6. Consistency in integer programming

    … the size of the branch-and-bound tree for integer programs. Cutting planes are traditionally used to tighten relaxations of the problem by excluding fractional solutions, which leads to improving the dual bounds. In this research, we study a fundamentally different role of cutting planes …

    iastate Repository record for Consistency in integer programming (opens in a new tab)

  7. Irrigation Scheduling with Integer Programming

    … or multi-machine scheduling problem. Mixed integer linear programming is used to develop a series of models that allow scheduling of irrigation turns in a wide range of irrigation systems. Given that duration and target time of the irrigation turns are specified by the users, the objective …

    soton Download PDF for Irrigation Scheduling with Integer Programming (opens in a new tab)

  8. 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)

  9. On primal integer programming methods.

    Advances in the field of integer programming have recently been made by Young and Glover, who have developed primal all integer integer programming alorithms. It is the purpose of this paper to gain computational experience and suggest techniques to improve the efficiency of the algorithm. A first …

    nps Repository record for On primal integer programming methods. (opens in a new tab)

  10. New approaches to integer programming

    Integer Programming (IP) is a powerful and widely-used formulation for combinatorial problems. The study of IP over the past several decades has led to fascinating theoretical developments, and has improved our ability to solve discrete optimization problems arising in practice. This thesis makes …

    gatech Repository record for New approaches to integer programming (opens in a new tab)

  11. Vector Balancing and Integer Programming

    … 9). Finally, we give a faster algorithm for integer programming (Chapter 10), a fundamental problem in discrete optimization, by providing a constructive answer to a question of Kannan and Lovasz and Dadush on the subspace flatness of convex bodies.

    washington Repository record for Vector Balancing and Integer Programming (opens in a new tab)

  12. Quantum Algorithms for Integer Programming Problems

    … uses of quantum computing algorithms in solving integer programming optimization problems. Specifically, the research investigates the application of Quantum Walks to address the Generalized Birkhoff Polytope of the Transportation Problem, as well as the application of the hybrid …

    ttu Repository record for Quantum Algorithms for Integer Programming Problems (opens in a new tab)

  13. The Proof Complexity of Integer Programming

    … systems which formalize modern algorithms for integer programming.Our contributions are as follows. A major conjecture in proof complexity is that random k-CNF formulas are hard to prove in every proof system. This conjecture has been confirmed for a number of proof systems [ChvatalS88, …

    toronto-retro Repository record for The Proof Complexity of Integer Programming (opens in a new tab)

Page 1 of 72