A branch and bound algorithm for the maximum diversity problem
Year of publication: |
2010
|
---|---|
Authors: | Burdett, R.L. ; Kozan, E. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 2430034. - Vol. 200.2010, 1 (1.1.), p. 36-45
|
Saved in:
Saved in favorites
Similar items by person
-
Techniques for inserting additional trains into existing timetables
Burdett, R.L., (2009)
-
A disjunctive graph model and framework for constructing new train schedules
Burdett, R.L., (2010)
-
Theoretical Papers - Sequencing and scheduling in flowshops with task redistribution
Burdett, R.L., (2001)
- More ...