送料無料 - 安全な支払い - 返金保証 ヘルプが必要ですか?

Binary Integer Optimization Problems

Implementation of a Branch and Bound Algorithm to Solve Binary Integer Optimization Problems
沿って Alaa Zayed - により販売されています Dodax EU
コンディション: 新品
¥5,540
税込価格-無料配送
Alaa Zayed Binary Integer Optimization Problems
Alaa Zayed - Binary Integer Optimization Problems

この商品が気に入りましたか?みんなにお薦めください!

¥5,540 含む VAT
1 個のアイテムしか利用できません 1 個のアイテムしか利用できません
配達: 2020-12-08 ~ 2020-12-10 の間
販売と配送: Dodax EU

詳細

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.

共演者・アシスタント

著者 Alaa Zayed

商品詳細

DUIN 1NMOTCC4BQ6

GTIN 9783844388923

言語 英語

ページ数 104

Product type 文庫本

¥5,540
弊社のWebサイトではCookieを使用して、サービスの効率とユーザーフレンドリーを高めています。 したがって、「Cookieを受け入れる」を選択してください! 詳細については、プライバシーポリシーをご覧ください。