Publications of M. Spadoni
|
|
This page shows all publications that appeared in the IASI annual research reports.
Authors currently affiliated with the Institute are always listed with the full name.
You can browse through them using either the links of the following line or those associated with
author names.
Show all publications of the year
ALL, with author Spadoni M., in the category ALL
(or show them all): (Items found: 8)
1994 | 1992 | 1990 | 1989
1994 [top]
- Bianco L., Mingozzi A., Ricciardelli S., Spadoni M.: Exact and heuristic procedures for the traveling salesman problem with precedence constraints, based on dynamic programming, Information Systems and Operational Research 32 (1), 19-32, 1994
1992 [top]
- Bianco L., Bielli M., Mingozzi A., Ricciardelli S., Spadoni M.: A heuristic procedure for the crew rostering problem, European Journal of Operational Research 56 (2), 272-283, 1992
- Bianco L., Bielli M., Mingozzi A., Ricciardelli S., Spadoni M.: A heuristic procedure for the crew rostering problem, European Journal of Operational Research 58, 272-283, 1992
1990 [top]
- Bianco L., Bielli M., Mingozzi A., Ricciardelli S., Spadoni M.: A heuristic procedure for the crew rostering problem., IASI-CNR, R. 285, 01/1990
- Bianco L., Mingozzi A., Ricciardelli S., Spadoni M.: New exact and heuristic algorithms for the crew scheduling problem, Lecture Notes in Control and Information Sciences, Springer-Verlag, 1990
- Bianco L., Mingozzi A., Ricciardelli S., Spadoni M.: Traveling salesman problem with precedence constraints., IASI-CNR, R. 310, 11/1990
1989 [top]
- Bianco L., Mingozzi A., Ricciardelli S., Spadoni M.: A single vehicle delivery problem., IASI-CNR, R. 254, 01/1989
- Bianco L., Mingozzi A., Ricciardelli S., Spadoni M.: Algorithms for the crew scheduling problem based on the set partitioning formulation., IASI-CNR, R. 280, 12/1989
|
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
|