✦ LIBER ✦

A Branch-and-Bound Based Method for Solving Monotone Optimization Problems

✍ Scribed by X. L. Sun; J. L. Li

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 177 KB
Volume: 35
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-005-3843-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-bound algorithm for solving

A branch-and-bound algorithm for solving fixed charge problems

✍ Patrick G. McKeown 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 616 KB

A branch-and-bound-based heuristic for s

A branch-and-bound-based heuristic for solving the quadratic assignment problem

✍ M. S. Bazaraa; O. Kirca 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 897 KB

An LP/NLP based branch and bound algorit

An LP/NLP based branch and bound algorithm for convex MINLP optimization problems

✍ I. Quesada; I.E. Grossmann 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 1009 KB

Decomposition branch and bound method fo

Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems

✍ Thai Quynh Phong; Le Thi Hoai An; Pham Dinh Tao 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 393 KB

Branch and bound methods for a search pr

Branch and bound methods for a search problem

✍ Alan R. Washburn 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

The problem of searching for randomly moving targets such as children and submarines is known to be fundamentally difficult, but finding efficient methods for generating optimal or near optimal solutions is nonetheless an important practical problem. This paper investigates the efficiency of Branch

A parallel branch and bound algorithm fo

A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems

✍ J. F. Pekny; D. L. Miller 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 902 KB