✦ LIBER ✦

Branch-and-Bound Variant of an Outcome-Based Algorithm for Optimizing over the Efficient Set of a Bicriteria Linear Programming Problem

✍ Scribed by J. Fülöp; L. D. Muu

Book ID: 111535777
Publisher: Springer
Year: 2000
Tongue: English
Weight: 118 KB
Volume: 105
Category: Article
ISSN: 0022-3239
DOI: 10.1023/a:1004657827134

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Bilinear Algorithm for Optimizing a Li

A Bilinear Algorithm for Optimizing a Linear Function over the Efficient Set of a Multiple Objective Linear Programming Problem

✍ Jesús M. Jorge 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 145 KB

An efficient branch-and-bound algorithm

An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem

✍ Wei-Chang Yeh 📂 Article 📅 2001 🏛 Society of Manufacturing Engineers 🌐 English ⚖ 826 KB

In this study, the two-machine bicriteria flowshop scheduling problem is addressed. The objective is to minimize a weighted sum of total flowtime and makespan. Different branch-and-bound algorithms have already appeared in the literature for this problem. In this study, a more efficient branch-and-b

An outcome space algorithm for optimizat

An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem

✍ Harold P. Benson 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 300 KB

An Outer Approximation Algorithm for Gen

An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem

✍ Harold P. Benson 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 225 KB

An efficient branch-and-bound algorithm

An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem : Wei-Chang Yeh, v20, n2, 2001, pp113–123

📂 Article 📅 2002 🏛 Society of Manufacturing Engineers 🌐 English ⚖ 296 KB

and keyword index optimization, the infrastructure is capable of finding robust error recovery algorithms. It is expected that this approach will require less time for the generation of robust error recovery logic.