๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Heuristics and exact algorithms for solving the Monden problem

โœ Scribed by J. Bautista; R. Companys; A. Corominas

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
869 KB
Volume
88
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Heuristic and exact algorithms for sched
Heuristic and exact algorithms for scheduling aircraft landings
โœ Ernst, Andreas T.; Krishnamoorthy, Mohan; Storer, Robert H. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 116 KB ๐Ÿ‘ 1 views

The problem of scheduling aircraft landings on one or more runways is an interesting problem that is similar to a machine job scheduling problem with sequence-dependent processing times and with earliness and tardiness penalties. The aim is to optimally land a set of planes on one or several runways

Exact algorithms for the master ring pro
Exact algorithms for the master ring problem
โœ Hadas Shachnai; Lisa Zhang; Tomomi Matsui ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 188 KB

## Abstract We consider the master ring problem (MRP) which often arises in optical network design. Given a network which consists of a collection of interconnected rings __R__~1~,โ€ฆ,__R__~__K__~, with __n__~1~,โ€ฆ,__n__~__K__~ distinct nodes, respectively, we need to find an ordering of the nodes in