2

An updated survey on the linear ordering problem for

Year:
2010
Language:
english
File:
PDF, 1.05 MB
english, 2010
3

Maximum Distance Between Slater Orders and Copeland Orders of Tournaments

Year:
2011
Language:
english
File:
PDF, 431 KB
english, 2011
9

The reversing number of a diagraph

Year:
1995
Language:
english
File:
PDF, 2.20 MB
english, 1995
10

The noising method: a new method for combinatorial optimization

Year:
1993
Language:
english
File:
PDF, 281 KB
english, 1993
14

Optimal clustering of multipartite graphs

Year:
2008
Language:
english
File:
PDF, 206 KB
english, 2008
17

Discriminating codes in (bipartite) planar graphs

Year:
2008
Language:
english
File:
PDF, 670 KB
english, 2008
18

New identifying codes in the binary Hamming space

Year:
2010
Language:
english
File:
PDF, 560 KB
english, 2010
19

On the complexity of Slater’s problems

Year:
2010
Language:
english
File:
PDF, 255 KB
english, 2010
22

A survey on the complexity of tournament solutions

Year:
2009
Language:
english
File:
PDF, 560 KB
english, 2009
23

The minimum density of an identifying code in the king lattice

Year:
2004
Language:
english
File:
PDF, 324 KB
english, 2004
24

Note

Year:
1997
Language:
english
File:
PDF, 362 KB
english, 1997
26

The noising methods: A generalization of some metaheuristics

Year:
2001
Language:
english
File:
PDF, 171 KB
english, 2001
27

Slater orders and Hamiltonian paths of tournaments

Year:
2000
Language:
english
File:
PDF, 173 KB
english, 2000
28

A note on “Banks winners in tournaments are difficult to recognize” by G. J. Woeginger

Year:
2004
Language:
english
File:
PDF, 152 KB
english, 2004
29

A smallest tournament for which the Banks set and the Copeland set are disjoint

Year:
1999
Language:
english
File:
PDF, 191 KB
english, 1999
30

Maximum Transfer Distance Between Partitions

Year:
2006
Language:
english
File:
PDF, 203 KB
english, 2006
31

Links between the Slater Index and the Ryser Index of Tournaments

Year:
2003
Language:
english
File:
PDF, 414 KB
english, 2003
33

NP-hardness results for the aggregation of linear orders into median

Year:
2008
Language:
english
File:
PDF, 592 KB
english, 2008
34

Noising methods for a clique partitioning problem

Year:
2006
Language:
english
File:
PDF, 255 KB
english, 2006
35

Preface

Year:
2008
Language:
english
File:
PDF, 72 KB
english, 2008
36

Application of the noising method to the travelling salesman problem

Year:
2000
Language:
english
File:
PDF, 413 KB
english, 2000
38

Lamarckian genetic algorithmsapplied to the aggregation of preferences

Year:
1998
Language:
english
File:
PDF, 97 KB
english, 1998
39

On the sizes of graphs and their powers: The undirected case

Year:
2011
Language:
english
File:
PDF, 430 KB
english, 2011
42

Lexicographic decomposition of preferences

Year:
2013
Language:
english
File:
PDF, 183 KB
english, 2013
44

Complexity of computing median linear orders and variants

Year:
2013
Language:
english
File:
PDF, 166 KB
english, 2013
45

A smallest tournament for which the Banks set and the Copeland set are disjoint

Year:
1999
Language:
english
File:
PDF, 571 KB
english, 1999
46

A note on "Banks winners in tournaments are difficult to recognize" by G. J. Woeginger

Year:
2004
Language:
english
File:
PDF, 220 KB
english, 2004
47

Contributions to Mathematical Psychology: the 2011 Meeting of the EMPG

Year:
2013
Language:
english
File:
PDF, 155 KB
english, 2013
49

On the number of optimal identifying codes in a twin-free graph

Year:
2015
Language:
english
File:
PDF, 369 KB
english, 2015