✦ LIBER ✦

An integer programming approach for linear programs with probabilistic constraints

✍ Scribed by James Luedtke; Shabbir Ahmed; George L. Nemhauser

Publisher: Springer-Verlag
Year: 2008
Tongue: English
Weight: 314 KB
Volume: 122
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-008-0247-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lagrangean decomposition for integer non

Lagrangean decomposition for integer nonlinear programming with linear constraints

✍ Philippe Michelon; Nelson Maculan 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 389 KB

A Mixed Integer Linear Programming appro

A Mixed Integer Linear Programming approach to pursuit evasion problems with optional connectivity constraints

✍ Johan Thunberg; Petter Ögren 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 575 KB

An advanced dual algorithm with constrai

An advanced dual algorithm with constraint relaxation for all-integer programming

✍ Larry M. Austin; Parviz Ghandforoush 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB

An integer linear-programming model for

An integer linear-programming model for machine scheduling

✍ Harvey M. Wagner 📂 Article 📅 1959 🏛 John Wiley and Sons 🌐 English ⚖ 540 KB

An improved algorithm for non-linear int

An improved algorithm for non-linear integer programming

✍ Mary W. Cooper 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 511 KB

Constraint Logic Programming and Integer

Constraint Logic Programming and Integer Programming approaches and their collaboration in solving an assignment scheduling problem

✍ Ken Darby-Dowman; James Little; Gautam Mitra; Marco Zaffalon 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 977 KB

Generalised Assignment Problems (GAP), traditionally solved by Integer Programming techniques, are addressed in the light of current Constraint Programming methods. A scheduling application from manufacturing, based on a modified GAP, is used to examine the performance of each technique under a vari