Lecture : Integer Programming , Spring 2010
نویسندگان
چکیده
2 Euclidean Algorithm and Hermite Normal Form 9 2.1 Sizes of Rational Numbers and Polynomial Complexity . . . . . . . . . . . . 9 2.2 Computing the GCD . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.3 Computing the Hermite Normal Form . . . . . . . . . . . . . . . . . . . . . . 12 2.4 Lattices and the Hermite Normal Form . . . . . . . . . . . . . . . . . . . . . 15 2.5 Dual Lattices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
منابع مشابه
IEOR 269 , Spring 2010 Integer Programming and Combinatorial Optimization
3 Non-linear Objective functions 4 3.1 Production problem with set-up costs . . . . . . . . . . . . . . . . . . . . . . . . . . 4 3.2 Piecewise linear cost function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3.3 Piecewise linear convex cost function . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.4 Disjunctive constraints . . . . . . . . . . . . . . . . . . . . . ...
متن کاملAN OPTIMIZATION METHOD TO DETERMINE THE LEAST COMMON MULTIPLY
This paper proposes an Integer Programming model to obtain the Least Common Multiply (LCM) for some integer numbers. The proposed method is illustrated by a numerical example.
متن کاملA MODIFIED METHOD TO DETERMINE A WELL-DISPERSED SUBSET OF NON-DOMINATED VECTORS OF AN MOMILP PROBLEM
This paper uses the L1−norm and the concept of the non-dominated vector, topropose a method to find a well-dispersed subset of non-dominated (WDSND) vectorsof a multi-objective mixed integer linear programming (MOMILP) problem.The proposed method generalizes the proposed approach by Tohidi and Razavyan[Tohidi G., S. Razavyan (2014), determining a well-dispersed subset of non-dominatedvectors of...
متن کاملAutomatic Alignment Between Classroom Lecture Utterances and Slide Components
Multimodal alignment between classroom lecture utterances and lecture slide components is one of the crucial problems to realize a multimodal e-Learning application. This paper proposes the new method for the automatic alignment, and formulates the alignment as the integer linear programming (ILP) problem to maximize the score function which consists of three factors: the similarity score betwe...
متن کاملThe preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach
Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...
متن کامل