Il rilassamento Lagrangiano in problemi di sequenziamento
Bollettino dell'Unione Matematica Italiana (2000)
- Volume: 3-A, Issue: 3, page 323-325
- ISSN: 0392-4041
Access Full Article
top
Abstract
topHow to cite
topDetti, Paolo. "Il rilassamento Lagrangiano in problemi di sequenziamento." Bollettino dell'Unione Matematica Italiana 3-A.3 (2000): 323-325. <http://eudml.org/doc/260957>.
@article{Detti2000,
abstract = {},
author = {Detti, Paolo},
journal = {Bollettino dell'Unione Matematica Italiana},
language = {ita},
month = {12},
number = {3},
pages = {323-325},
publisher = {Unione Matematica Italiana},
title = {Il rilassamento Lagrangiano in problemi di sequenziamento},
url = {http://eudml.org/doc/260957},
volume = {3-A},
year = {2000},
}
TY - JOUR
AU - Detti, Paolo
TI - Il rilassamento Lagrangiano in problemi di sequenziamento
JO - Bollettino dell'Unione Matematica Italiana
DA - 2000/12//
PB - Unione Matematica Italiana
VL - 3-A
IS - 3
SP - 323
EP - 325
AB -
LA - ita
UR - http://eudml.org/doc/260957
ER -
References
top- ADOLPHSON, A. e HU, T.C., Optimal Linear Ordering, SIAM Journal of Applied Mathematics, 25(1973), 403-423. Zbl0274.90061MR345618
- 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. Zbl0794.90039MR1202000DOI10.1137/0803002
- BALAS, E., FISCHETTI, M. e PULLEYBLANK, W.R., The Precedence-Constrained Asymmetric Traveling Salesman Polytope, Mathematical Programming, 68 (1995), 241-265. Zbl0835.90109MR1319523DOI10.1007/BF01585767
- DETTI, P. e PACCIARELLI, D., A branch and bound algorithm for the Minimum Storage-Time Sequencing problem, Naval Research Logistics, 48(2001), 313-333. Zbl1077.90080MR1821736DOI10.1002/nav.11
- ESCUDERO, L.F., An Inexact Algorithm for the Sequential Ordering Problem, European Journal of Operational Research, 37(1988), 236-249 Zbl0653.90036MR963929DOI10.1016/0377-2217(88)90333-5
- ORTUÑO, M.T., Sobre cortes Lagrangianos Fuertes en la resolución del Problema del Ordenamiento Secuencial, PhD Thesis, Universidad Complutense de Madrid (1995).
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.