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 6 of 6 for “"pseudo Boolean optimization"”.

  1. Big-Data Driven Optimization Methods with Applications to LTL Freight Routing

    … with a focus on distributed parallel MIP optimization. Although our proposals are inspired by the Less-than-truckload (LTL) freight routing problem, they are more generally applicable to hard MIPs from other domains. We start by developing an Integer Programming model for the …

    mcmaster Repository record for Big-Data Driven Optimization Methods with Applications to LTL Freight Routing (opens in a new tab)

  2. Discrete Optimization in Early Vision - Model Tractability Versus Fidelity

    … problems of early vision. The first part studies pseudo-boolean optimization, both from a theoretical perspective as well as a practical one by introducing new algorithms. The main result is the generalization of the roof duality concept to polynomials of higher degree than two. Another focus is …

    lund Repository record for Discrete Optimization in Early Vision - Model Tractability Versus Fidelity (opens in a new tab) Download PDF for Discrete Optimization in Early Vision - Model Tractability Versus Fidelity (opens in a new tab)

  3. Multi-Quality Auto-Tuning by Contract Negotiation

    … in combination with the contracts to generate optimization problems in different formalisms (Integer Linear Programming (ILP), Pseudo-Boolean Optimization (PBO), Ant Colony Optimization (ACO) and Multi-Objective Integer Linear Programming (MOILP)). Standard solvers are applied to derive …

    qucosa-diss

  4. A step toward constant time local search for optimizing pseudo Boolean functions

    Pseudo Boolean Functions (PBFs) are the objective functions for a wide class of hard optimization problems, such as MAX-SAT and MAX-CUT. Since these problems are NP-Hard, researchers and practitioners rely on incomplete solvers, such as Stochastic Local Search (SLS), for large problems. …

    colostate Repository record for A step toward constant time local search for optimizing pseudo Boolean functions (opens in a new tab)

  5. Certifying Combinatorial Optimization : A Unified Approach Using Pseudo-Boolean Reasoning

    Combinatorial optimization is a powerful way to solve complex problems, like planning, scheduling, or hardware verification, by expressing the problem in a mathematical form using discrete variables that can be solved by general solvers. Due to major advances in algorithms for solving combinatorial …

    lund Repository record for Certifying Combinatorial Optimization : A Unified Approach Using Pseudo-Boolean Reasoning (opens in a new tab) Download PDF for Certifying Combinatorial Optimization : A Unified Approach Using Pseudo-Boolean Reasoning (opens in a new tab)