Olivier Goldschmidt

25 papers A* 1C 1Journal 20Unranked 3
YearRankTypeTitle / Venue / Authors
2026 C conf
A Fast Algorithm for Euclidean Maximum Weight Non-Bipartite Matching.
ICPRAM
Philipp Baumann, Olivier Goldschmidt, Dorit S. Hochbaum
2026 J jnl
A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm.
CoRR
Philipp Baumann, Olivier Goldschmidt, Dorit S. Hochbaum, Jason Yang
2025 J jnl
A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem.
Eur. J. Oper. Res.
Dorit S. Hochbaum, Philipp Baumann, Olivier Goldschmidt, Y. Zhang
2025 J jnl
Fast and Optimal Incremental Parametric Procedure for the Densest Subgraph Problem: An Experimental Study.
CoRR
Dorit S. Hochbaum, Ayleen Irribarra-Cortés, Olivier Goldschmidt, Roberto Javier Asín Achá
2024 J jnl
Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques.
Networks
Roberto Javier Asín Achá, Alexis Espinoza, Olivier Goldschmidt, Dorit S. Hochbaum, Isaías I. Huerta
2023 — conf
A Breakpoints Based Method for the Maximum Diversity and Dispersion Problems.
ACDA
Dorit S. Hochbaum, Zhihao Liu, Olivier Goldschmidt
2022 — conf
Fast Algorithms for the Capacitated Vehicle Routing Problem using Machine Learning Selection of Algorithm's Parameters.
KDIR
Roberto Javier Asín Achá, Olivier Goldschmidt, Dorit S. Hochbaum, Isaías I. Huerta
2011 — conf
An adaptive routing system for location-aware mobile devices on the road network.
ITSC
Paul Borokhov, Sebastien Blandin, Samitha Samaranayake, Olivier Goldschmidt, Alexandre M. Bayen
2003 J jnl
SONET/SDH Ring Assignment with Capacity Constraints.
Discret. Appl. Math.
Olivier Goldschmidt, Alexandre Laugier, Eli V. Olinick
2003 J jnl
The SONET edge-partition problem.
Networks
Olivier Goldschmidt, Dorit S. Hochbaum, Asaf Levin, Eli V. Olinick
1998 J jnl
Combinatorial Issues in Air Traffic Optimization.
Transp. Sci.
Rémy Fondacci, Olivier Goldschmidt, Vincent Letrouit
1997 J jnl
A new and improved algorithm for the 3-cut problem.
Oper. Res. Lett.
Michel Burlet, Olivier Goldschmidt
1997 J jnl
Local Optimality and Its Application on Independent Sets for k-claw Free Graphs.
J. Comb. Optim.
Gang Yu, Olivier Goldschmidt
1997 J jnl
k-edge Subgraph Problems.
Discret. Appl. Math.
Olivier Goldschmidt, Dorit S. Hochbaum
1996 J jnl
Approximation Algorithms for the
SIAM J. Discret. Math.
Olivier Goldschmidt, Dorit S. Hochbaum, Cor A. J. Hurkens, Gang Yu
1996 J jnl
Randomized methods for the number partitioning problem.
Comput. Oper. Res.
Michael F. Argüello, Thomas A. Feo, Olivier Goldschmidt
1994 J jnl
A Polynomial Algorithm for the k-cut Problem for Fixed k.
Math. Oper. Res.
Olivier Goldschmidt, Dorit S. Hochbaum
1994 J jnl
An efficient graph planarization two-phase heuristic.
Networks
Olivier Goldschmidt, Alexan Takvorian
1994 J jnl
On reliability of graphs with node failures.
Networks
Olivier Goldschmidt, Patrick Jaillet, Richard Lasota
1993 J jnl
A Modified Greedy Heuristic for the Set Covering Problem with Improved Worst Case Bound.
Inf. Process. Lett.
Olivier Goldschmidt, Dorit S. Hochbaum, Gang Yu
1992 J jnl
Bibliographic Section.
Transp. Sci.
Vanolin F. Hurdle, Arjang A. Assad, Olivier Goldschmidt
1992 J jnl
One-Half Approximation Algorithms for the k-Partition Problem.
Oper. Res.
Thomas A. Feo, Olivier Goldschmidt, Mallek Khellaf
1990 J jnl
A Fast Perfect-Matching Algorithm in Random Graphs.
SIAM J. Discret. Math.
Olivier Goldschmidt, Dorit S. Hochbaum
1990 J jnl
Asymptotically Optimal Linear Algorithm for the Minimum
SIAM J. Discret. Math.
Olivier Goldschmidt, Dorit S. Hochbaum
1988 A* conf
Polynomial Algorithm for the k-Cut Problem
FOCS
Olivier Goldschmidt, Dorit S. Hochbaum