Similar Search Results

Random generation of tournaments and asymmetric graphs with given out-degrees

Charon, I.; Germa, A.; Hudry, O. - In: European journal of operational research : EJOR 95 (1996) 2, pp. 411-419

Persistent link: https://www.econbiz.de/10006678189

Lamarckian genetic algorithms applied to the aggregation of preferences

Charon, I.; Hudry, O. - 1998

Persistent link: https://www.econbiz.de/10008219211

Median linear orders: Heuristics and a branch and bound algorithm

Barthelemy, J. P.; Guenoche, A.; Hudry, O. - In: European Journal of Operational Research 42 (1989) 3, pp. 313-325

Persistent link: https://www.econbiz.de/10005283826

Some rainbow problems in graphs have complexity equivalent to satisfiability problems

Hudry, Olivier; Lobstein, Antoine - In: International Transactions in Operational Research 29 (2020) 3, pp. 1547-1572

Persistent link: https://www.econbiz.de/10012282406

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

Hudry, Olivier - In: Social Choice and Welfare 16 (1999) 1, pp. 137-143

Given a tournament T, a Banks winner of T is the first vertex of any maximal (with respect to inclusion) transitive subtournament of T; a Copeland winner of T is a vertex with a maximum out-degree. In this paper, we show that 13 is the minimum number of vertices that a tournament must have so...

Persistent link: https://www.econbiz.de/10005369320

Maximum Transfer Distance Between Partitions

Charon, Irene; Denoeud, Lucile; Guenoche, Alain; Hudry, … - In: Journal of Classification 23 (2006) 1, pp. 103-121

Persistent link: https://www.econbiz.de/10005376153

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

Hudry, Olivier - In: Social Choice and Welfare 23 (2004) 1, pp. 113-114

Given a tournament T, a Banks winner of T is the first vertex of any maximal (with respect to inclusion) transitive subtournament of T. While Woeginger shows that recognizing whether a given vertex of T is a Banks winner is NP-complete, the computation of a Banks winner of T is polynomial, and...

Persistent link: https://www.econbiz.de/10005147171

The noising methods: A generalization of some metaheuristics

Charon, Irene; Hudry, Olivier - In: European Journal of Operational Research 135 (2001) 1, pp. 86-101

Persistent link: https://www.econbiz.de/10005253454

Application of the noising method to the travelling salesman problem

Charon, Irene; Hudry, Olivier - In: European Journal of Operational Research 125 (2000) 2, pp. 266-277

Persistent link: https://www.econbiz.de/10005253500

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

Hudry, Olivier - In: Social choice and welfare 23 (2004) 1, pp. 113-114

Persistent link: https://www.econbiz.de/10006881536