A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
Year of publication: |
2011
|
---|---|
Authors: | Fan, Neng ; Pardalos, Panos M. |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 22.2011, 4, p. 747-762
|
Subject: | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | USA | United States | Theorie | Theory |
-
Complexity of the two-stage no-wait assembly problem with setup and removal times separated
Strusevič, Vitalij Aleksandrovič, (1991)
-
Computing puiseux-series explansion via combinatorial relaxation
Murota, Kazuo, (1989)
-
An application of quantitative economic analysis to timber production scheduling problems
Holmes, Mac Reese, (1971)
- More ...
-
Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs
Fan, Neng, (2012)
-
Robust chance-constrained support vector machines with second-order moment information
Wang, Ximing, (2018)
-
Linear and quadratic programming approaches for the general graph partitioning problem
Fan, Neng, (2010)
- More ...