Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core. - George Mavrotas; José Rui Figueira; Kostas Florios (Appl. Math. Comput., 2009)

Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms. - Kostas Florios; George Mavrotas; Danae Diakoulaki (Eur. J. Oper. Res., 2010)

An improved version of the augmented ε-constraint method (AUGMECON2) for finding the exact pareto set in multi-objective integer programming problems. - George Mavrotas; Kostas Florios (Appl. Math. Comput., 2013)

Generation of the exact Pareto set in Multi-Objective Traveling Salesman and Set Covering Problems. - Kostas Florios; George Mavrotas (Appl. Math. Comput., 2014)

An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: A computational study and comparison with meta-heuristics. - George Mavrotas; Kostas Florios; José Rui Figueira (Appl. Math. Comput., 2015)

Possible earthquake forecasting in a narrow space-time-magnitude window. - Kostas Florios; Ioannis Contopoulos; Giorgos Tatsis; Vasilis Christofilakis; Spyridon K. Chronopoulos; Christos Repapis; Vasilis Tritakis (Earth Sci. Informatics, 2021)

HITS: Hyperplanes intersection tabu search for maximum score estimation. - Kostas Florios; Alexandros Louka; Yannis Bilias (SoftwareX, 2025)