Il rilassamento Lagrangiano in problemi di sequenziamento
Detti, Paolo
Bollettino dell'Unione Matematica Italiana, Tome 3-A (2000), p. 323-325 / Harvested from Biblioteca Digitale Italiana di Matematica
Access to full text
Full (PDF)
Full (DjVu)

Publié le : 2000-12-01
@article{BUMI_2000_8_3A_3_323_0,
     author = {Paolo Detti},
     title = {Il rilassamento Lagrangiano in problemi di sequenziamento},
     journal = {Bollettino dell'Unione Matematica Italiana},
     volume = {3-A},
     year = {2000},
     pages = {323-325},
     zbl = {Zbl 1053.90510},
     language = {it},
     url = {http://dml.mathdoc.fr/item/BUMI_2000_8_3A_3_323_0}
}

Detti, Paolo. Il rilassamento Lagrangiano in problemi di sequenziamento. Bollettino dell'Unione Matematica Italiana, Tome 3-A (2000) pp. 323-325. http://gdmltest.u-ga.fr/item/BUMI_2000_8_3A_3_323_0/

[1] Adolphson, A. e Hu, T.C., Optimal Linear Ordering, SIAM Journal of Applied Mathematics, 25(1973), 403-423. | MR 345618 | Zbl 0274.90061

[2] Ascheuer, N., Escudero, L.F., Grötschel, M., e Stoer, M., A cutting Plane Approach to the Sequential Ordering Problem (With Applications to Job Scheduling in Manufacturing), SIAM Journal on Optimization, 3(1993), 25-42. | MR 1202000 | Zbl 0794.90039

[3] Balas, E., Fischetti, M. e Pulleyblank, W.R., The Precedence-Constrained Asymmetric Traveling Salesman Polytope, Mathematical Programming, 68 (1995), 241-265. | MR 1319523 | Zbl 0835.90109

[4] Detti, P. e Pacciarelli, D., A branch and bound algorithm for the Minimum Storage-Time Sequencing problem, Naval Research Logistics, 48(2001), 313-333. | MR 1821736 | Zbl 1077.90080

[5] Escudero, L.F., An Inexact Algorithm for the Sequential Ordering Problem, European Journal of Operational Research, 37(1988), 236-249 | MR 963929 | Zbl 0653.90036

[6] Ortuño, M.T., Sobre cortes Lagrangianos Fuertes en la resolución del Problema del Ordenamiento Secuencial, PhD Thesis, Universidad Complutense de Madrid (1995).