Solving Integer programming Problem on Parallel Virtual Machine
碩士 === 國立清華大學 === 資訊科學研究所 === 85 === Integer Programming Problems are numerical optimization problems that arise frequently in operations research. Their classical solution method is a tree-search based branch and bound algorithm in which each tree node represents a linear programming problem. Al...
Main Authors: | Hsu, Chi-Che, 許繼哲 |
---|---|
Other Authors: | Wang, Biing-Feng |
Format: | Others |
Language: | en_US |
Published: |
1997
|
Online Access: | http://ndltd.ncl.edu.tw/handle/55162875982763532876 |
Similar Items
-
Parallel algorithms for solving mixed integer linear programs
by: Nwana, Vincent Lebga
Published: (2001) -
Integer programming-based decomposition approaches for solving machine scheduling problems
by: Sadykov, Ruslan
Published: (2006) -
Comparative Analysis of Mixed Integer Programming Formulations for Single-Machine and Parallel-Machine Scheduling Problems
by: Kuo-Ching Ying, et al.
Published: (2019-01-01) -
MIPCL LIBRARY FOR SOLVING MIXED INTEGER PROGRAMMING PROBLEMS
by: N. N. Pisaruk
Published: (2016-09-01) -
Method for solving a convex integer programming problem
by: Stefan M. Stefanov
Published: (2003-01-01)