Polynomial Algorithm for the k-Cut Problem - Olivier Goldschmidt; Dorit S. Hochbaum (FOCS, 1988)

A Fast Perfect-Matching Algorithm in Random Graphs. - Olivier Goldschmidt; Dorit S. Hochbaum (SIAM J. Discret. Math., 1990)

Asymptotically Optimal Linear Algorithm for the Minimum k-Cut in a Random Graph. - Olivier Goldschmidt; Dorit S. Hochbaum (SIAM J. Discret. Math., 1990)

One-Half Approximation Algorithms for the k-Partition Problem. - Thomas A. Feo; Olivier Goldschmidt; Mallek Khellaf (Oper. Res., 1992)

Bibliographic Section. - Vanolin F. Hurdle; Arjang A. Assad; Olivier Goldschmidt (Transp. Sci., 1992)

A Modified Greedy Heuristic for the Set Covering Problem with Improved Worst Case Bound. - Olivier Goldschmidt; Dorit S. Hochbaum; Gang Yu 001 (Inf. Process. Lett., 1993)

A Polynomial Algorithm for the k-cut Problem for Fixed k. - Olivier Goldschmidt; Dorit S. Hochbaum (Math. Oper. Res., 1994)

On reliability of graphs with node failures. - Olivier Goldschmidt; Patrick Jaillet; Richard Lasota (Networks, 1994)

An efficient graph planarization two-phase heuristic. - Olivier Goldschmidt; Alexan Takvorian (Networks, 1994)

Randomized methods for the number partitioning problem. - Michael F. Argüello; Thomas A. Feo; Olivier Goldschmidt (Comput. Oper. Res., 1996)

Approximation Algorithms for the k-Clique Covering Problem. - Olivier Goldschmidt; Dorit S. Hochbaum; Cor A. J. Hurkens; Gang Yu 001 (SIAM J. Discret. Math., 1996)

k-edge Subgraph Problems. - Olivier Goldschmidt; Dorit S. Hochbaum (Discret. Appl. Math., 1997)

Local Optimality and Its Application on Independent Sets for k-claw Free Graphs. - Gang Yu 001; Olivier Goldschmidt (J. Comb. Optim., 1997)

A new and improved algorithm for the 3-cut problem. - Michel Burlet; Olivier Goldschmidt (Oper. Res. Lett., 1997)

Combinatorial Issues in Air Traffic Optimization. - Rémy Fondacci; Olivier Goldschmidt; Vincent Letrouit (Transp. Sci., 1998)

SONET/SDH Ring Assignment with Capacity Constraints. - Olivier Goldschmidt; Alexandre Laugier; Eli V. Olinick (Discret. Appl. Math., 2003)

The SONET edge-partition problem. - Olivier Goldschmidt; Dorit S. Hochbaum; Asaf Levin; Eli V. Olinick (Networks, 2003)

An adaptive routing system for location-aware mobile devices on the road network. - Paul Borokhov; Sebastien Blandin; Samitha Samaranayake; Olivier Goldschmidt; Alexandre M. Bayen (ITSC, 2011)

Fast Algorithms for the Capacitated Vehicle Routing Problem using Machine Learning Selection of Algorithm's Parameters. - Roberto Javier Asín Achá; Olivier Goldschmidt; Dorit S. Hochbaum; Isaías I. Huerta (KDIR, 2022)

A Breakpoints Based Method for the Maximum Diversity and Dispersion Problems. - Dorit S. Hochbaum; Zhihao Liu; Olivier Goldschmidt (ACDA, 2023)

Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques. - Roberto Javier Asín Achá; Alexis Espinoza; Olivier Goldschmidt; Dorit S. Hochbaum; Isaías I. Huerta (Networks, 2024)

A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem. - Dorit S. Hochbaum; Philipp Baumann; Olivier Goldschmidt; Y. Zhang (Eur. J. Oper. Res., 2025)