Experiments with parallel algorithms for combinatorial problems
Year of publication: |
1988
|
---|---|
Authors: | Kindervater, G. A. ; Trienekens, H. W. J. M. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 33.1988, 1, p. 65-81
|
Subject: | Programmanalyse dynamisch ganzzahlig | Scheduling-Verfahren | Scheduling problem | Branch-and-Bound | Branch and Bound | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming | USA | United States | Experiment | Theorie | Theory | Algorithmus | Algorithm |
-
Hammoudan, Zakaria, (2016)
-
Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem
Aïder, Méziane, (2022)
-
The parallel stack loading problem of minimizing the exact number of relocations
Tanaka, Shunji, (2024)
- More ...
-
Experiments with parallel algorithms for combinatorial problems
Kindervater, G. A., (1985)
-
Local search for vehicle routing and scheduling problems
Kindervater, G. A., (1995)
-
Experiments with parallel algorithms for combinatorial problems
Kindervater, G. A. P., (1988)
- More ...