Solving diameter-constrained minimum spanning tree problems by constraint programming
Year of publication: |
2010
|
---|---|
Authors: | Noronha, Thiago F. ; Ribeiro, Celso C. ; Santos, Andréa Cynthia |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 17.2010, 5, p. 653-665
|
Subject: | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
-
A branch and bound algorithm for the job shop scheduling problem
Błażewicz, Jacek, (1998)
-
Population-based iterated greedy algorithm for the S-labeling problem
Lozano, Manuel, (2023)
- More ...
-
Assunção, Lucas, (2017)
-
Model and methods to address urban road network problems with disruptions
Huang, Yipeng, (2019)
-
Metaheuristics for the work‐troops scheduling problem
Barbalho, Thiago Jobson, (2020)
- More ...