✦ LIBER ✦

Optimal 3-terminal cuts and linear programming

✍ Scribed by Kevin K. H. Cheung; William H. Cunningham; Lawrence Tang

Publisher: Springer-Verlag
Year: 2005
Tongue: English
Weight: 290 KB
Volume: 106
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-005-0668-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal stopping, exponential utility, a

Optimal stopping, exponential utility, and linear programming

✍ Eric V. Denardo; Uriel G. Rothblum 📂 Article 📅 1979 🏛 Springer-Verlag 🌐 English ⚖ 742 KB

Stochastic Optimal Control and Linear Pr

Stochastic Optimal Control and Linear Programming Approach

✍ R. Buckdahn; D. Goreac; M. Quincampoix 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 502 KB

Decomposition and Dynamic Cut Generation

Decomposition and Dynamic Cut Generation in Integer Linear Programming

✍ Ted K. Ralphs; Matthew V. Galati 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 462 KB

New Branch-and-Cut Algorithm for Bilevel

New Branch-and-Cut Algorithm for Bilevel Linear Programming

✍ C. Audet; G. Savard; W. Zghal 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 436 KB

Optimal control for linear system using

Optimal control for linear system using genetic programming

✍ A. Vincent Antony Kumar; P. Balasubramaniam 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 113 KB

A branch-reduce-cut algorithm for the gl

A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs

✍ Myun-Seok Cheon; Shabbir Ahmed; Faiz Al-Khayyal 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 292 KB

We consider probabilistically constrained linear programs with general distributions for the uncertain parameters. These problems involve non-convex feasible sets. We develop a branch-and-bound algorithm that searches for a global optimal solution to this problem by successively partitioning the non