𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Median linear orders: Heuristics and a branch and bound algorithm

✍ Scribed by J.P. Barthelemy; A. Guenoche; O. Hudry

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
901 KB
Volume
42
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A branch-and-price algorithm for the cap
A branch-and-price algorithm for the capacitated p-median problem
✍ Alberto Ceselli; Giovanni Righini πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 178 KB πŸ‘ 1 views

## Abstract The capacitated __p__‐median problem is the variation of the well‐known __p__‐median problem in which a demand is associated to each user, a capacity is associated to each candidate median, and the total demand of the users associated to the same median must not exceed its capacity. We

A parallel branch-and-bound algorithm fo
A parallel branch-and-bound algorithm for integer linear programming and its implementation on a distributed multiprocessor
✍ Atsuko Ikegami; Katsuhiro Aoyagi; Hajime Iizuka πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 830 KB

## Abstract This paper describes a parallel branch‐and‐bound algorithm for general integer linear programming problems and its implementation on a distributed memory multiprocessor nCUBE2. With a branch‐and‐bound algorithm, the amount of computation on each search tree node varies, and in general,

Protein tertiary structure prediction us
Protein tertiary structure prediction using a branch and bound algorithm
✍ Volker A. Eyrich; Daron M. Standley; Anthony K. Felts; Richard A. Friesner πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 217 KB πŸ‘ 2 views

We report a new method for predicting protein tertiary structure from sequence and secondary structure information. The predictions result from global optimization of a potential energy function, including van der Waals, hydrophobic, and excluded volume terms. The optimization algorithm, which is ba