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 678 for “"mixed-Integer programming"”.
-
Subadditive Approaches to Mixed Integer Programming
… (1975) and Klabjan (2007) for solving pure integer linear programming problems are studied. These algorithms rely on Gomory's corner relaxation and subadditive duality. Examples are given to demonstrate the failure of these algorithms on specific IPs and ways of correcting errors in some …
-
ON THE COMPLEXITY OF MIXED INTEGER PROGRAMMING
We study the theoretical complexity of mixed integer programming algorithms. We first discuss the relative efficiency of branch and bound (BB) and cutting plane (CP) algorithms in different scenarios. We made the comparisons based on two concrete measures: number of iterations and sparsity of …
-
Mixed Integer Programming Approaches for Group Decision Making
… by formulating the decision-making problem as a mixed integer nonlinear program (MINLP), providing feedback by solving the MINLP in real-time, and allowing the general public to contribute their opinions. Since an interactive component is involved, it is the goal of this thesis to attempt to …
-
Algorithms for Multi-Objective Mixed Integer Programming Problems
… over the efficient set for bi-objective mixed integer linear programs. The second group includes an application of a special case of optimization over the efficient on conservation planning problems modeled with modern portfolio theory. Finally, the third group presents a machine learning …
-
Advanced underground mine scheduling using mixed integer programming
Includes bibliographical references (pages 107-111).
-
Cutting Planes for Large Mixed Integer Programming Models
… this thesis I focus on cutting planes for large Mixed Integer Programming (MIP) problems. More specifically, I focus on two independent cutting planes studies. The first of these deals with cutting planes for the Traveling Salesman Problem (TSP), and the second with cutting planes for general …
-
Mixed Integer Programming Approaches to Novel Vehicle Routing Problems
… flows, resource allocation, and vehicle routing mixed integer programming approaches to be able to incorporate all of these data in a winter road maintenance framework. We also show that solution approaches which have proved useful in network flows and vehicle routing problems can be adapted to …
-
TUNING OPTIMIZATION SOFTWARE PARAMETERS FOR MIXED INTEGER PROGRAMMING PROBLEMS
… is of key interest to researchers solving mixed integer programming (MIP) problems. The efficiency of the optimization software can be greatly impacted by the solver’s parameter settings and the structure of the MIP. A designed experiment approach is used to fit a statistical model that …
-
Mixed integer programming approaches for nonlinear and stochastic programming
… methods that capitalize on the success of Linear Programming (LP) based solvers for Mixed Integer Linear Programming (MILP). A common aspect of our solution approaches is the use, development and analysis of small but strong extended LP/MILP formulations and approximations. In the first part of …
-
Large-scale unit commitment: Decentralized mixed integer programming approaches
… application of decentralized optimization for mixed integer programming (MIP) problems. Our focus is on loosely coupled MIPs where different blocks of the problem have mixed integer linear feasible sets and a small number of linear constraints couple these blocks together. We develop …
-
Cutting planes in mixed integer programming: theory and algorithms
Recent developments in mixed integer programming have highlighted the need for multi-row cuts. To this day, the performance of such cuts has typically fallen short of the single-row Gomory mixed integer cut. This disparity between the theoretical need and the practical shortcomings of multi-row …
-
Mixed integer programming models for supply chain integrated planning
… at the finishing plants for individual products. Mixed Integer Program (MIP) formulations are utilized for optimizing the system. Test cases include both small sized and large sized problems. Analysis is done to gain insights into the workings of the models and systems like these in general. In …
-
Stream water quality management: A stochastic mixed-integer programming model.
… through a general stochastic cost minimization mixed-integer linear programming (MIP) model. Traditional approaches for addressing variability in stream conditions are unlikely to satisfy the assumptions on which these methodologies are founded or are inadequate in addressing the problem …
-
Evaluating Mixed-Integer Programming Models over Multiple Right-hand Sides
A critical measure of the quality of a mixed-integer programming (MIP) model with fixed data is the difference, or gap, between the optimal objective value of the linear programming relaxation and that of the corresponding MIP. In many contexts, only an approximation of the right-hand sides may be …
-
The Maximum Anchored k-core Problem: Mixed Integer Programming Formulations
… the network. In this thesis, we investigate two mixed integer programming (MIP) formulations for the maximum anchored k-core problem: (i) a naive model and (ii) a strong model. We examine the MIP formulations analytically and computationally. We also compare the computational performance of the …
-
A stochastic mixed integer programming approach to wildfire management systems
… under uncertainty in fire growth. A stochastic mixed-integer programming approach is proposed in order to take into account the uncertainty in the problem data and to allow for robust wildfire management decisions under uncertainty. For computational results, the tactical decision model is …
-
Bound tightening to improve branch-and-bound mixed-integer programming
Includes bibliographical references.
-
FIXED ORDER BRANCH AND BOUND METHODS FOR MIXED-INTEGER PROGRAMMING.
… this dissertation is to present an algorithm for mixed integer programs which when started with a good heuristic solution can find improved solutions and reduce the error estimate as quickly as possible. This is achieved by using two ideas: a fixed order branch-and-bound method with selective …
Page 1 of 34