A portable and scalable algorithm for a class of constrained combinatorial optimization problems

Gespeichert in:
Bibliographische Detailangaben
Titel: A portable and scalable algorithm for a class of constrained combinatorial optimization problems
Autoren: S SALCEDOSANZ
Quelle: Computers & Operations Research.
Verlagsinformationen: Elsevier BV, 2004.
Publikationsjahr: 2004
Publikationsart: Article
Sprache: English
ISSN: 0305-0548
DOI: 10.1016/s0305-0548(04)00072-3
Zugangs-URL: http://agamenon.tsc.uah.es/Personales/sancho/revistas/Computers&OR2005_3.pdf
Rights: Elsevier TDM
Dokumentencode: edsair.doi...........41f8a49cd0b4c1fa92cba94a6bceec6d
Datenbank: OpenAIRE
Beschreibung
ISSN:03050548
DOI:10.1016/s0305-0548(04)00072-3