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 9 of 9 for “"Cutting-Plane Algorithms"”.

  1. Parallel cutting plane algorithms for inverse mixed integer linear programming

    <p>We present parallel cutting plane algorithms for the inverse mixed integer linear programming problem (InvMILP), which are extended algorithms of the cutting plane algorithms for InvMILP. It improves the efficiency of the original algorithm and provides feasible solutions before terminating …

    iastate Repository record for Parallel cutting plane algorithms for inverse mixed integer linear programming (opens in a new tab)

  2. Models and Algorithms for Real-Time Systems

    We apply the framework of parameterized algorithms to the FP (fixed-priority) and EDF (earliest- deadline-first) scheduling of recurrent (periodic and sporadic) task systems in a preemptive uniprocessor environment, which are fundamental models in real-time scheduling theory. We identify parameters …

    wustl Repository record for Models and Algorithms for Real-Time Systems (opens in a new tab)

  3. A Quick-and-Dirty Approach to Robustness in Linear Optimization

    … as strong as robust optimization. Interactive cutting-plane algorithms are developed for concave and quasi-concave utility functions. We present some probabilistic bounds for feasibility and evaluate our approach by means of computational experiments.

    waterloo Repository record for A Quick-and-Dirty Approach to Robustness in Linear Optimization (opens in a new tab)

  4. The extreme point mathematical programming problem

    … research addresses the design and analysis of algorithms for EPMP. However, most of the ideas are quite general and apply to a wider class of mathematical programs including the Generalized Lattice Point Problem. We obtain a variety of cutting plane algorithms and analyze the convergence of …

    vt Repository record for The extreme point mathematical programming problem (opens in a new tab)

  5. Optimizing over the cut cone: A new polyhedral algorithm for the maximum-weight cut problem

    Polyhedral cutting-plane algorithms for hard combinatorial problems have scored notable successes. However, computational research on the Maximum-Weight Cut Problem (MCP) on undirected graphs has been inconclusive. In 1988, Barahona suggested a new polyhedral algorithm that, given a good initial …

    rice Repository record for Optimizing over the cut cone: A new polyhedral algorithm for the maximum-weight cut problem (opens in a new tab)

  6. Covering relaxation methods for solving the zero-one positive polynomial programming problem

    Covering relaxation algorithms were first developed by Granot et al for solving positive 0-1 polynomial programming (PP) problems which maximize a linear objective function in 0-1 variables subject to a set of polynomial inequalities containing only positive coefficients ["Covering Relaxation for …

    ubc Repository record for Covering relaxation methods for solving the zero-one positive polynomial programming problem (opens in a new tab) Download PDF for Covering relaxation methods for solving the zero-one positive polynomial programming problem (opens in a new tab)

  7. Problems, Models and Algorithms in One- and Two-Dimensional Cutting

    … Mathematics and Operations Research, problems of cutting and packing (C&P) of concrete and abstract objects appear under various specifications (cutting problems, knapsack problems, container and vehicle loading problems, pallet loading, bin packing, assembly line balancing, capital budgeting, …

    qucosa-diss

  8. Relaxations for the dynamic knapsack problem with stochastic item sizes

    … and quadratic bounds, whereby, in the spirit of cutting plane algorithms, we successively improve upon a changing value function approximation through both column and constraint generation. We provide theoretical closed form solutions for the zero capacity case as well as an extensive …

    gatech Repository record for Relaxations for the dynamic knapsack problem with stochastic item sizes (opens in a new tab)

  9. Multi-Agent Integer Programming Games with Non-Cooperation and Cooperation

    … guarantee and hybridized with the zero-regret cutting-plane method (BZR), lifting tractable PNE computation and sampling from a handful of players to dozens; the methods are instantiated on edge-weighted budgeted maximum coverage games, including a Minnesota aquatic invasive species (AIS) …

    vt Repository record for Multi-Agent Integer Programming Games with Non-Cooperation and Cooperation (opens in a new tab)