“…The literature includes many works on this area related to combinatorial optimization. Some examples, among many others, include minimax problems (Hansen, 1980;Schrijver, 1983), combining minisum and minimax (Averbakh and Berman, 1995;Hansen and Labbé, 1988;Hansen et al, 1991;Minoux, 1989;Punnen et al, 1995;Tamir et al, 2002), k-centrum optimization (Garfinkel et al, 2006;Kalcsics et al, 2002;Punnen, 1992;Slater, 1978a,b;Tamir, 2000), lexicographic optimization (Calvete and Mateo, 1998;Croce et al, 1999), k-th best solutions (Lawler, 1972;Martello et al, 1984;Pascoal et al, 2003;Yen, 1971), most uniform solutions (Galil and Schieber, 1998;López de los Mozos et al, 2008), minimumenvy solutions (Espejo et al, 2009), solutions with minimum deviation (Gupta et al, 1990), regret solutions (Averbakh, 2001;Conde, 2004;Puerto and Rodríguez-Chía, 2003), equity measures (Gupta and Punnen, 1988;López de los Mozos et al, 2008;Mesa et al, 2003;Punnen and Aneja, 1997), discrete ordered median location problems (Boland et al, 2006;Marín et al, 2009;Puerto, 2008;Puerto and Tamir, 2005;Puerto and Rodríguez-Chía, 2015), ordered weighted average objectives (Fernández et al, 2013(Fernández et al, , 2014Galand and Spanjaard, 2012), and covering objectives …”