✦ LIBER ✦

A quadratically convergent global algorithm for the linearly-constrained minimum cross-entropy problem

✍ Scribed by S.C. Fang; H.S.J. Tsao

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 720 KB
Volume: 79
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)90365-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Global optimization algorithms for linea

Global optimization algorithms for linearly constrained indefinite quadratic problems

✍ Panos M. Pardalos 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 663 KB

A branch-and-cut algorithm for the resou

A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem

✍ Fischetti, Matteo; Vigo, Daniele 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 2 views

In this paper, we present a branch-and-cut algorithm for the exact solution of an NP-hard extension of the well-known Minimum-Weight Arborescence (MWA) problem, in which resource constraints for each node are considered. This Resource-Constrained Minimum-Weight Arborescence (RMWA) problem arises, e.