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 42 for “"Integer Programming (IP)"”.

  1. Formulating the Rotating Workforce Scheduling Problem with Applications to Police Rostering

    … Rotating Workforce Scheduling Problem. The 0-1 integer programming (IP) formulation seeks to maximize the number of nonworking (free) weekends while enforcing constraints based on the minimum staffing levels for each shift on each given day, minimum and maximum limits on the length of work and …

    buffalo Repository record for Formulating the Rotating Workforce Scheduling Problem with Applications to Police Rostering (opens in a new tab)

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

  3. Modeling the Homeschool timetabling problem using Integer programming

    … specialty constraints that are to be satisfied. Integer programming (IP) has been used in solving the HSTP as it has the advantage of being able to provide information about the relative significance of each constraint with respect to the objective. A prototype in the form of a GUI has been built …

    vcu Repository record for Modeling the Homeschool timetabling problem using Integer programming (opens in a new tab)

  4. Sustainable development: a strategy for regaining control of Northern Mali

    … initiatives. Finally, the author uses integer programming (IP) to formulate, solve, and interpret the intervention strategy. The author evaluates two IP models to allocate sustainable-development projects optimally for the purposes of rehabilitating desert lands, gaining compliance from …

    nps Repository record for Sustainable development: a strategy for regaining control of Northern Mali (opens in a new tab)

  5. Optimization Approaches to Protein Folding

    … HP-lattice protein folding model. We built two integer programming (IP) models and five constraint programming (CP) models. All the models give provably optimal solutions. We also developed some CP techniques to solve the problem faster and then compared their computational times. We tested the …

    gatech Repository record for Optimization Approaches to Protein Folding (opens in a new tab)

  6. Supply Chain Optimization of Blood Products

    … centers and hospitals. The first model uses an integer programming (IP) approach to identify the optimal order levels that minimizes the total cost, shortage and wastage levels of blood products at a hospital within a specified planning horizon. The IP model explicitly considers the age of blood …

    usf Repository record for Supply Chain Optimization of Blood Products (opens in a new tab)

  7. Approximation Algorithms and Heuristics for a Heterogeneous Traveling Salesman Problem

    … For these applications, there is a need for multiple vehicles with different capabilities to visit and monitor a set of given targets. In such scenarios, routing problems arise naturally where there is a need to plan paths in order to optimally use resources and time. The focus of this thesis is …

    tamu Repository record for Approximation Algorithms and Heuristics for a Heterogeneous Traveling Salesman Problem (opens in a new tab)

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

  9. A Large-Scale Neighborhood Search Algorithm for Multi-Activity Tour Scheduling Problems

    … to solve. In order to address the problem, an integer programming (IP) approach is first proposed. Due to the problems’ high degree of flexibility, it is impossible to solve instances involving numerous employees and activities in a timely and efficient manner. This leads to the proposal of a …

    mcmaster Repository record for A Large-Scale Neighborhood Search Algorithm for Multi-Activity Tour Scheduling Problems (opens in a new tab)

  10. Application of Integer Programming for Mine Evacuation Modeling with Multiple Transportation Modes

    … Gold Mines) was conducted to validate the Integer Programming (IP) model. Statistical analysis of the IP model in comparison with a benchmark MCNF model proved that leveraging the use of mine vehicles during an emergency can further reduce the total evacuation time. A cost-savings analysis …

    unr Repository record for Application of Integer Programming for Mine Evacuation Modeling with Multiple Transportation Modes (opens in a new tab)

  11. Advanced Interior Point Formulation for the Global Routing Problem

    … the hardware design process is divided into multiple phases, many of the divided problems are still extremely time consuming to solve. One of these NP-hard problems is the routing problem. As electronics step into the deep submicron era, optimizing the routing becomes increasingly important. One …

    waterloo Repository record for Advanced Interior Point Formulation for the Global Routing Problem (opens in a new tab)

  12. ADVERTISEMENT ALLOCATION AND TRUST MECHANISMS DESIGN IN SOCIAL NETWORKS

    … in solving the problem compared to the baseline integer programming (IP) formulation. In studying the problem of trust mechanisms in social networks, we consider the existence of distrust (i.e. negative trust) relationships, and differentiate between the concept of local trust and global trust in …

    maryland Repository record for ADVERTISEMENT ALLOCATION AND TRUST MECHANISMS DESIGN IN SOCIAL NETWORKS (opens in a new tab)

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

  14. Towards Trustworthy Machine Learning: An Integer Programming Approach

    … to integrate into existing algorithms. Integer Programming (IP) is a natural tool for these problems as many simple interpretable ML models can be represented by low-complexity discrete objects, and it allows for the flexible incorporation of domain-specific constraints such as fairness …

    cornell Repository record for Towards Trustworthy Machine Learning: An Integer Programming Approach (opens in a new tab)

  15. Solving MAXSAT by Decoupling Optimization and Satisfaction

    … interacting components: the logical relationships between the variables expressed by the clauses, and the optimization component involving minimizing the falsified clauses. The interaction between these components greatly contributes to the difficulty of solving MAXSAT. The main contribution of …

    toronto-retro Repository record for Solving MAXSAT by Decoupling Optimization and Satisfaction (opens in a new tab)

  16. Scheduling inbound calls in call centers

    … Specifically, we formulate three different Integer Programming (IP) problems for such call scheduling, with objective functions of 1) minimizing the Total Flow Time (TFT), 2) minimizing the Maximum Flow Time (MFT) of any call, and 3) minimizing the Maximum Deviation of Cumulative Assigned …

    iastate Repository record for Scheduling inbound calls in call centers (opens in a new tab)

  17. A long-term, spatially constrained harvest scheduling model for Eucalyptus plantations in the southeast of Mexico

    … optimality using traditional approaches such as integer programming (IP). In this study, a genetic algorithms (GA) model was used to generate multiple viable solutions for long-term spatially constrained problems on large areas with a great number of management units. This model enables …

    arizona-thes Repository record for A long-term, spatially constrained harvest scheduling model for Eucalyptus plantations in the southeast of Mexico (opens in a new tab)

  18. Multicommodity network flow models with FIFO transshipment handling policies

    Integer multicommodity network flow (MCNF) models have applications in various areas like logistics, freight transportation, telecommunication and manufacturing. In this thesis we study an extension of the integer MCNF problem (MCNF-FIFO) where commodities are handled (processed) in a …

    texas Repository record for Multicommodity network flow models with FIFO transshipment handling policies (opens in a new tab)

  19. Models and methods for integer programming under structure and uncertainty

    Integer Programming (IP) is a fundamental tool of modern decision-making; however, these problems are highly combinatorial and often require exponential time to solve. Such computational difficulty can also be enhanced by the specific algebraic structures of the solution space. Each combinatorial …

    soton Repository record for Models and methods for integer programming under structure and uncertainty (opens in a new tab) Download PDF for Models and methods for integer programming under structure and uncertainty (opens in a new tab)

  20. Optimization Methods based on Decision Diagrams for Constraint Programming, AI Planning, and Mathematical Programming

    … optimization approaches based on constraint programming (CP), artificial intelligence (AI), and integer programming (IP). The central thesis of this dissertation is that DDs are effective tools to capture complex combinatorial structures of discrete optimization problems that are not fully …

    toronto-retro Repository record for Optimization Methods based on Decision Diagrams for Constraint Programming, AI Planning, and Mathematical Programming (opens in a new tab)

Page 1 of 3