( en | de | ru )

 

Disambiguation of "Bergé, Pierre"

Author of the publication

copydeleteadd this publication to your clipboard
On Simulated Annealing Dedicated to Maximin Latin Hypercube Designs.

, , , and . CoRR, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Louis-Pierre Bergé

Bernd Bergé

Nathalie Bergé

Stefaan Bergé

Meike Bergé-Hasmann

 

Other publications of authors with the same name

1-Extendability of Independent Sets., , , and . Algorithmica, 86 (3): 757-781 (March 2024)Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width., , , and . CoRR, (2022)1-Extendability of Independent Sets., , , and . IWOCA, volume 13270 of Lecture Notes in Computer Science, page 172-185. Springer, (2022)Multiple Canadians on the road: minimizing the distance competitive ratio., , , , , and . J. Comb. Optim., 38 (4): 1086-1100 (2019)A lower bound for weak Schur numbers with a deterministic algorithm., , , and . J. Discrete Algorithms, (2018)On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem., , , and . COCOA, volume 11346 of Lecture Notes in Computer Science, page 566-576. Springer, (2018)Restricting the search space to boost Quantum Annealing performance., , , and . CEC, page 3238-3245. IEEE, (2016)Search Space Exploration and an Optimization Criterion for Hard Design Problems., , , and . GECCO (Companion), page 43-44. ACM, (2016)The Competitiveness of Randomized Strategies for Canadians via Systems of Linear Inequalities., , , and . ISCIS, volume 935 of Communications in Computer and Information Science, page 96-103. Springer, (2018)Improved Deterministic Strategy for the Canadian Traveller Problem Exploiting Small Max-(s, t)-Cuts., and . WAOA, volume 11926 of Lecture Notes in Computer Science, page 29-42. Springer, (2019)