The SCEAS System
Navigation Menu

Search the dblp DataBase


Mikkel T. Jensen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mikkel T. Jensen
    Guiding Single-Objective Optimization Using Multi-objective Methods. [Citation Graph (0, 0)][DBLP]
    EvoWorkshops, 2003, pp:268-279 [Conf]
  2. Mikkel T. Jensen
    Neighbourhood Based Robustness Applied to Tardiness and Total Flowtime Job Shops. [Citation Graph (0, 0)][DBLP]
    PPSN, 2000, pp:283-292 [Conf]
  3. Mikkel T. Jensen
    Improving robustness and flexibility of tardiness and total flow-time job shops using robustness measures. [Citation Graph (0, 0)][DBLP]
    Appl. Soft Comput., 2001, v:1, n:1, pp:35-52 [Journal]
  4. Mikkel T. Jensen
    Generating robust and flexible job shop schedules using genetic algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Evolutionary Computation, 2003, v:7, n:3, pp:275-288 [Journal]
  5. Mikkel T. Jensen
    Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Evolutionary Computation, 2003, v:7, n:5, pp:503-515 [Journal]
  6. Rasmus K. Ursem, Thiemo Krink, Mikkel T. Jensen, Zbigniew Michalewicz
    Analysis and modeling of control tasks in dynamic systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Evolutionary Computation, 2002, v:6, n:4, pp:378-389 [Journal]
  7. Mikkel T. Jensen, Moutaz J. Khouja
    An optimal polynomial time algorithm for the common cycle economic lot and delivery scheduling problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2004, v:156, n:2, pp:305-311 [Journal]

Search in 0.002secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002