𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A tree search algorithm for the crew scheduling problem

✍ Scribed by J.E. Beasley; B. Cao

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

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A branch-and-price algorithm for a hiera
A branch-and-price algorithm for a hierarchical crew scheduling problem
✍ Diego B.C. Faneyte; Frits C.R. Spieksma; Gerhard J. Woeginger πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 122 KB πŸ‘ 1 views

## Abstract We describe a real‐life problem arising at a crane rental company. This problem is a generalization of the basic crew scheduling problem given in Mingozzi et al. [18] and Beasley and Cao [6]. We formulate the problem as an integer programming problem and establish ties with the integer

A tabu search algorithm for the Capacita
A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
✍ Sharaiha, Yazid M.; Gendreau, Michel; Laporte, Gilbert; Osman, Ibrahim H. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 150 KB πŸ‘ 2 views

The Capacitated Shortest Spanning Tree Problem consists of determining a shortest spanning tree in a vertex weighted graph such that the weight of every subtree linked to the root by an edge does not exceed a prescribed capacity. We propose a tabu search heuristic for this problem, as well as dynami