✦ LIBER ✦

Solving a (0, 1) hyperbolic program by branch and bound

✍ Scribed by Alan L. Saipe

Publisher: John Wiley and Sons
Year: 1975
Tongue: English
Weight: 645 KB
Volume: 22
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800220308

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 a class of nonlinear integer programming problems

✍ A. Victor Cabot; S. Selcuk Erenguc 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 501 KB

A branch and bound algorithm for globall

A branch and bound algorithm for globally solving a class of nonconvex programming problems

✍ Hongwei Jiao 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 574 KB

Using branch-and-bound to solve bi-level

Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model

✍ R.S. Segall 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 397 KB

Combined branch-and-bound and cutting pl

Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems

✍ LÊ D. Muu; W. Oettli 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 701 KB

A read-once lower bound and a (1,+k)-hie

A read-once lower bound and a (1,+k)-hierarchy for branching programs

✍ P. Savický; S. Žák 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 143 KB

Branching programs (b. p.'s) or decision diagrams are a general graph-based model of sequential computation. The b. p.'s of polynomial size are a nonuniform counterpart of LOG. Lower bounds for di erent kinds of restricted b. p.'s are intensively investigated. An important restriction are the so-cal

Solving a class of low rank d.c. program

Solving a class of low rank d.c. programs via a branch and bound approach: A computational experience

✍ Riccardo Cambini; Francesca Salvi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 269 KB