Olivier Goldschmidt

Publication Activity (10 Years)

Years Active: 1988-2023
Publications (10 Years): 2

Top Topics

Parameter Choices

Related Algorithms

Machine Learning

Top Venues

Publications

Dorit S. Hochbaum, Zhihao Liu, Olivier Goldschmidt
A Breakpoints Based Method for the Maximum Diversity and Dispersion Problems. ACDA (2023)
Roberto Javier Asín Achá, Olivier Goldschmidt, Dorit S. Hochbaum, Isaías I. Huerta
Fast Algorithms for the Capacitated Vehicle Routing Problem using Machine Learning Selection of Algorithm's Parameters. KDIR (2022)
Paul Borokhov, Sebastien Blandin, Samitha Samaranayake, Olivier Goldschmidt, Alexandre M. Bayen
An adaptive routing system for location-aware mobile devices on the road network. ITSC (2011)
Olivier Goldschmidt, Dorit S. Hochbaum, Asaf Levin, Eli V. Olinick
The SONET edge-partition problem. Networks 41 (1) (2003)
Olivier Goldschmidt, Alexandre Laugier, Eli V. Olinick
SONET/SDH Ring Assignment with Capacity Constraints. Discret. Appl. Math. 129 (1) (2003)
Rémy Fondacci, Olivier Goldschmidt, Vincent Letrouit
Combinatorial Issues in Air Traffic Optimization. Transp. Sci. 32 (3) (1998)
Gang Yu, Olivier Goldschmidt
Local Optimality and Its Application on Independent Sets for k-claw Free Graphs. J. Comb. Optim. 1 (2) (1997)
Michel Burlet, Olivier Goldschmidt
A new and improved algorithm for the 3-cut problem. Oper. Res. Lett. 21 (5) (1997)
Olivier Goldschmidt, Dorit S. Hochbaum
k-edge Subgraph Problems. Discret. Appl. Math. 74 (2) (1997)
Olivier Goldschmidt, Dorit S. Hochbaum, Cor A. J. Hurkens, Gang Yu
-Clique Covering Problem. SIAM J. Discret. Math. 9 (3) (1996)
Michael F. Argüello, Thomas A. Feo, Olivier Goldschmidt
Randomized methods for the number partitioning problem. Comput. Oper. Res. 23 (2) (1996)
Olivier Goldschmidt, Patrick Jaillet, Richard Lasota
On reliability of graphs with node failures. Networks 24 (4) (1994)
Olivier Goldschmidt, Alexan Takvorian
An efficient graph planarization two-phase heuristic. Networks 24 (2) (1994)
Olivier Goldschmidt, Dorit S. Hochbaum
A Polynomial Algorithm for the k-cut Problem for Fixed k. Math. Oper. Res. 19 (1) (1994)
Olivier Goldschmidt, Dorit S. Hochbaum, Gang Yu
A Modified Greedy Heuristic for the Set Covering Problem with Improved Worst Case Bound. Inf. Process. Lett. 48 (6) (1993)
Thomas A. Feo, Olivier Goldschmidt, Mallek Khellaf
One-Half Approximation Algorithms for the k-Partition Problem. Oper. Res. 40 (Supplement-1) (1992)
Vanolin F. Hurdle, Arjang A. Assad, Olivier Goldschmidt
Bibliographic Section. Transp. Sci. 26 (4) (1992)
Olivier Goldschmidt, Dorit S. Hochbaum
-Cut in a Random Graph. SIAM J. Discret. Math. 3 (1) (1990)
Olivier Goldschmidt, Dorit S. Hochbaum
A Fast Perfect-Matching Algorithm in Random Graphs. SIAM J. Discret. Math. 3 (1) (1990)
Olivier Goldschmidt, Dorit S. Hochbaum
Polynomial Algorithm for the k-Cut Problem FOCS (1988)