✦ LIBER ✦

An interior-point Benders based branch-and-cut algorithm for mixed integer programs

✍ Scribed by Naoum-Sawaya, Joe; Elhedhli, Samir

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An interior point cutting plane heuristi

✍ Joe Naoum-Sawaya; Samir Elhedhli 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 200 KB

An improved branch and bound algorithm f

✍ Brian Borchers; John E. Mitchell 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 870 KB

Classical cuts for mixed-integer program

✍ Manfred Padberg 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 310 KB

Classical Cuts for Mixed-Integer Program

✍ Manfred Padberg 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 671 KB

bc–opt: a branch-and-cut code for mixed

✍ Cécile Cordier; Hugues Marchand; Richard Laundy; Laurence A. Wolsey 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 131 KB

An improved branch-and-cut algorithm for

✍ Yushan Zhu; Yijiong Hu; Hao Wu; Masaru Nakaiwa 📂 Article 📅 2008 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 145 KB 👁 2 views