Olivier Goldschmidt - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2025

A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problemDorit S. Hochbaum, Philipp Baumann, Olivier Goldschmidt, Y. Zhang. eor, 323(2):425-440, 2025. [doi]

2024

Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniquesRoberto Javier Asín Achá, Alexis Espinoza, Olivier Goldschmidt, Dorit S. Hochbaum, Isaías I. Huerta. networks, 84(4):465-480, 2024. [doi]

2023

A Breakpoints Based Method for the Maximum Diversity and Dispersion ProblemsDorit S. Hochbaum, Zhihao Liu, Olivier Goldschmidt. acda 2023: 189-200 [doi]

2022

Fast Algorithms for the Capacitated Vehicle Routing Problem using Machine Learning Selection of Algorithm's ParametersRoberto Javier Asín Achá, Olivier Goldschmidt, Dorit S. Hochbaum, Isaías I. Huerta. ic3k 2022: 29-39 [doi]

2011

An adaptive routing system for location-aware mobile devices on the road networkPaul Borokhov, Sebastien Blandin, Samitha Samaranayake, Olivier Goldschmidt, Alexandre M. Bayen. itsc 2011: 1839-1845 [doi]

2003

SONET/SDH Ring Assignment with Capacity ConstraintsOlivier Goldschmidt, Alexandre Laugier, Eli V. Olinick. DAM, 129(1):99-128, 2003. [doi]

The SONET edge-partition problemOlivier Goldschmidt, Dorit S. Hochbaum, Asaf Levin, Eli V. Olinick. networks, 41(1):13-23, 2003. [doi]

1998

Combinatorial Issues in Air Traffic OptimizationRÃ©my Fondacci, Olivier Goldschmidt, Vincent Letrouit. transci, 32(3):256-267, 1998. [doi]

1997

A new and improved algorithm for the 3-cut problemMichel Burlet, Olivier Goldschmidt. orl, 21(5):225-227, 1997. [doi]

k-edge Subgraph ProblemsOlivier Goldschmidt, Dorit S. Hochbaum. DAM, 74(2):159-169, 1997. [doi]

Local Optimality and Its Application on Independent Sets for k-claw Free GraphsGang Yu, Olivier Goldschmidt. jco, 1(2):151-164, 1997.

1996

Randomized methods for the number partitioning problemMichael F. Argüello, Thomas A. Feo, Olivier Goldschmidt. cor, 23(2):103-111, 1996. [doi]

Approximation Algorithms for the ::::k::::-Clique Covering ProblemOlivier Goldschmidt, Dorit S. Hochbaum, Cor A. J. Hurkens, Gang Yu. siamdm, 9(3):492-509, 1996. [doi]

1994

An efficient graph planarization two-phase heuristicOlivier Goldschmidt, Alexan Takvorian. networks, 24(2):69-73, 1994. [doi]

On reliability of graphs with node failuresOlivier Goldschmidt, Patrick Jaillet, Richard Lasota. networks, 24(4):251-259, 1994. [doi]

A Polynomial Algorithm for the k-cut Problem for Fixed kOlivier Goldschmidt, Dorit S. Hochbaum. mor, 19(1):24-37, 1994. [doi]

1993

A Modified Greedy Heuristic for the Set Covering Problem with Improved Worst Case BoundOlivier Goldschmidt, Dorit S. Hochbaum, Gang Yu. ipl, 48(6):305-310, 1993.

1992

One-Half Approximation Algorithms for the k-Partition ProblemThomas A. Feo, Olivier Goldschmidt, Mallek Khellaf. ior, 40(Supplement-1), 1992. [doi]

Bibliographic SectionVanolin F. Hurdle, Arjang A. Assad, Olivier Goldschmidt. transci, 26(4):355-361, 1992. [doi]

1990

Asymptotically Optimal Linear Algorithm for the Minimum ::::k::::-Cut in a Random GraphOlivier Goldschmidt, Dorit S. Hochbaum. siamdm, 3(1):58-73, 1990.

A Fast Perfect-Matching Algorithm in Random GraphsOlivier Goldschmidt, Dorit S. Hochbaum. siamdm, 3(1):48-57, 1990.

1988

Polynomial Algorithm for the k-Cut ProblemOlivier Goldschmidt, Dorit S. Hochbaum. focs 1988: 444-451

Sign in or sign up to see more results.

runs on WebDSL