Книга: Alaa Zayed «Binary Integer Optimization Problems»
|
Производитель: "LAP Lambert Academic Publishing" Many problems that arise in manufacturing and socio-economic systems, such as machine scheduling, vehicle routing, resource management, and telecommunications network design, can be modeled as 0-1 integer programs. Therefore, the branch and bound algorithm, which is the core concept of this thesis, is proposed for the purpose of solving these problems significantly. The main goal is not only to present the theory and exact technique of this algorithm but also to build or construct an application to obtain the best solution of these models. Moreover, this application is expected to help the Businessmen, managers, decision makers, and interested people in this field to optimize many of these practical problems and save them some time which might be have been wasted looking for solutions for those problems. ISBN:9783844388923 Издательство: "LAP Lambert Academic Publishing" (2011)
ISBN: 9783844388923 |
См. также в других словарях:
Integer factorization — In number theory, integer factorization is the way of breaking down a composite number into smaller non trivial divisors, which when multiplied together equal the original integer.When the numbers are very large, no efficient integer… … Wikipedia
Binary decision diagram — In the field of computer science, a binary decision diagram (BDD) or branching program, like a negation normal form (NNF) or a propositional directed acyclic graph (PDAG), is a data structure that is used to represent a Boolean function. On a… … Wikipedia
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
Compiler optimization — is the process of tuning the output of a compiler to minimize or maximize some attributes of an executable computer program. The most common requirement is to minimize the time taken to execute a program; a less common one is to minimize the… … Wikipedia
Algorithmic efficiency — In computer science, efficiency is used to describe properties of an algorithm relating to how much of various types of resources it consumes. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or… … Wikipedia
Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… … Wikipedia
