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 47 for “"Integer programming problems"”.
-
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 …
-
Lower bounds for integer programming problems
Solving real world problems with mixed integer programming (MIP) involves efforts in modeling and efficient algorithms. To solve a minimization MIP problem, a lower bound is needed in a branch-and-bound algorithm to evaluate the quality of a feasible solution and to improve the efficiency of the …
-
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 …
-
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 …
-
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 would …
-
Obtaining a bounded near-optimum solution to linear integer programming problems
Includes bibliographical references.
-
Heuristic algorithm for solving economic models formulated as 0-1 integer programming problems, A
Includes bibliographical references (pages 74-78).
-
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 …
-
Some Computational Aspects of the Branch and Bound Method for Integer Programs
… method are tested on capital budgeting type integer programming problems. The standard up and down penalties are compared with Tomlin's improved penalties. The use of the 'priority order' derived from the objective coefficients is also examined. A new heuristic--"the nearer integer rule"--is …
-
Reoptimization in interior-point methods with application to integer programming
… in a branch-and-bound framework for 0/1 mixed integer programming problems. This work is motivated by the observation that there are instances of integer programming problems where each individual linear program generated in a branch-and-bound tree can be solved much faster by an interior-point …
-
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 …
-
Optimization Models for Designing Spatially Compact Ecological Reserve Systems
… reserve systems are addressed here as zero-one integer programming problems. These formulations have a bicriteria objective function that is a combination of both boundary length and distance. The two formulations cluster the sites into a relatively small number of compact groups while …
-
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 …
-
Algorithms for solving linear integer progamming problems
… discusses several methods used to solve linear integer programming problems. Chapters 1-3 give the necessary linear programming background. Chapter 4 introduces integer programming and describes, in general, the two classes of solution methods -enumeration and cutting planes. Chapter 5 details …
-
The extreme point mathematical programming problem
… Point Mathematical Programs (EPMP). These problems are generalizations of certain Integer Programming problems and also find their application in other nonconvex programs like the Concave Minimization problem. The research addresses the design and analysis of algorithms for EPMP. However, …
-
Approximating Large-Scale Binary Integer Programs by Discrete Optimal Control
… a powerful tool for approximately solving binary integer programming problems. In previous studies, an approach using continuous optimal control theory was developed, where the original binary integer problem was transformed into a continuous linear quadratic problem. However, the continualization …
-
RROS reliability redundancy optimization solver: A Microsoft Excel add-in
… algorithm for solving nonlinear separable integer programming problems, as they arise in the field of system reliability. The reliability redundancy optimization solver (RROS) improves on a hybrid technique of dynamic programming with depth first search with tighter variable bounds. The …
-
Scheduling in a Multi-Sector Wireless Cell
… possible in resource utilization. Both of these problems are large integer programming problems that can be solved numerically using a commercial solver, but for real time use, efficient heuristics need to be developed. We design heuristics for these two problems and validate them by comparing …
-
INVESTIGATING THE EXACT EFFECTIVENESS OF CUTTING PLANES OVER BRANCH-AND-BOUND IN INTEGER PROGRAMMING
… to branch-and-cut (BC) techniques in convex 0/1 integer programming under variable disjunctions, with a focus on the three-dimensional setting. We prove that for a range of three-dimensional convex 0/1 integer programming problems, any valid inequality established by a BC proof tree can be …
Page 1 of 3