𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An improved branch-and-cut algorithm for mixed-integer nonlinear systems optimization problem

✍ Scribed by Yushan Zhu; Yijiong Hu; Hao Wu; Masaru Nakaiwa


Publisher
American Institute of Chemical Engineers
Year
2008
Tongue
English
Weight
145 KB
Volume
54
Category
Article
ISSN
0001-1541

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A branch-and-cut algorithm for solving a
✍ Lee, Youngho; Sherali, Hanif D.; Han, Junghee; Kim, Seong-in πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 133 KB πŸ‘ 2 views

In this paper, we deal with a network design problem arising from the deployment of synchronous optical networks (SONET), a standard of transmission using optical fiber technology. The problem is to find an optimal clustering of traffic demands in the network such that the total number of node assig