Olivier Goldschmidt

According to our database, Olivier Goldschmidt authored at least 20 papers between 1988 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

A Breakpoints Based Method for the Maximum Diversity and Dispersion Problems.

Dorit S. Hochbaum, Zhihao Liu, Olivier Goldschmidt

Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023

2022

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

Proceedings of the 14th International Joint Conference on Knowledge Discovery, 2022

2011

An adaptive routing system for location-aware mobile devices on the road network.

Paul Borokhov, Sebastien Blandin, Samitha Samaranayake, Olivier Goldschmidt, Alexandre M. Bayen

Proceedings of the 14th International IEEE Conference on Intelligent Transportation Systems, 2011

2003

The SONET edge-partition problem.

Olivier Goldschmidt, Dorit S. Hochbaum, Asaf Levin, Eli V. Olinick

Networks, 2003

SONET/SDH Ring Assignment with Capacity Constraints.

Olivier Goldschmidt, Alexandre Laugier, Eli V. Olinick

Discret. Appl. Math., 2003

1998

Combinatorial Issues in Air Traffic Optimization.

Rémy Fondacci, Olivier Goldschmidt, Vincent Letrouit

Transp. Sci., 1998

1997

A new and improved algorithm for the 3-cut problem.

Michel Burlet, Olivier Goldschmidt

Oper. Res. Lett., 1997

Local Optimality and Its Application on Independent Sets for k-claw Free Graphs.

Gang Yu, Olivier Goldschmidt

J. Comb. Optim., 1997

k-edge Subgraph Problems.

Olivier Goldschmidt, Dorit S. Hochbaum

Discret. Appl. Math., 1997

1996

Approximation Algorithms for the <i>k</i>-Clique Covering Problem.

Olivier Goldschmidt, Dorit S. Hochbaum, Cor A. J. Hurkens, Gang Yu

SIAM J. Discret. Math., 1996

Randomized methods for the number partitioning problem.

Michael F. Argüello, Thomas A. Feo, Olivier Goldschmidt

Comput. Oper. Res., 1996

1994

An efficient graph planarization two-phase heuristic.

Olivier Goldschmidt, Alexan Takvorian

Networks, 1994

On reliability of graphs with node failures.

Olivier Goldschmidt, Patrick Jaillet, Richard Lasota

Networks, 1994

A Polynomial Algorithm for the k-cut Problem for Fixed k.

Olivier Goldschmidt, Dorit S. Hochbaum

Math. Oper. Res., 1994

1993

A Modified Greedy Heuristic for the Set Covering Problem with Improved Worst Case Bound.

Olivier Goldschmidt, Dorit S. Hochbaum, Gang Yu

Inf. Process. Lett., 1993

1992

Bibliographic Section.

Vanolin F. Hurdle, Arjang A. Assad, Olivier Goldschmidt

Transp. Sci., 1992

One-Half Approximation Algorithms for the k-Partition Problem.

Thomas A. Feo, Olivier Goldschmidt, Mallek Khellaf

Oper. Res., 1992

1990

Asymptotically Optimal Linear Algorithm for the Minimum <i>k</i>-Cut in a Random Graph.

Olivier Goldschmidt, Dorit S. Hochbaum

SIAM J. Discret. Math., 1990

A Fast Perfect-Matching Algorithm in Random Graphs.

Olivier Goldschmidt, Dorit S. Hochbaum

SIAM J. Discret. Math., 1990

1988

Polynomial Algorithm for the k-Cut Problem

Olivier Goldschmidt, Dorit S. Hochbaum

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988