default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlivier Goldschmidt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c4]Dorit S. Hochbaum, Zhihao Liu, Olivier Goldschmidt:
A Breakpoints Based Method for the Maximum Diversity and Dispersion Problems. ACDA 2023: 189-200- 2022
- [c3]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: 29-39
2010 – 2019
- 2011
- [c2]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: 1839-1845
2000 – 2009
- 2003
- [j16]Olivier Goldschmidt, Alexandre Laugier, Eli V. Olinick:
SONET/SDH Ring Assignment with Capacity Constraints. Discret. Appl. Math. 129(1): 99-128 (2003) - [j15]Olivier Goldschmidt, Dorit S. Hochbaum, Asaf Levin, Eli V. Olinick:
The SONET edge-partition problem. Networks 41(1): 13-23 (2003)
1990 – 1999
- 1998
- [j14]Rémy Fondacci, Olivier Goldschmidt, Vincent Letrouit:
Combinatorial Issues in Air Traffic Optimization. Transp. Sci. 32(3): 256-267 (1998) - 1997
- [j13]Olivier Goldschmidt, Dorit S. Hochbaum:
k-edge Subgraph Problems. Discret. Appl. Math. 74(2): 159-169 (1997) - [j12]Gang Yu, Olivier Goldschmidt:
Local Optimality and Its Application on Independent Sets for k-claw Free Graphs. J. Comb. Optim. 1(2): 151-164 (1997) - [j11]Michel Burlet, Olivier Goldschmidt:
A new and improved algorithm for the 3-cut problem. Oper. Res. Lett. 21(5): 225-227 (1997) - 1996
- [j10]Michael F. Argüello, Thomas A. Feo, Olivier Goldschmidt:
Randomized methods for the number partitioning problem. Comput. Oper. Res. 23(2): 103-111 (1996) - [j9]Olivier Goldschmidt, Dorit S. Hochbaum, Cor A. J. Hurkens, Gang Yu:
Approximation Algorithms for the k-Clique Covering Problem. SIAM J. Discret. Math. 9(3): 492-509 (1996) - 1994
- [j8]Olivier Goldschmidt, Dorit S. Hochbaum:
A Polynomial Algorithm for the k-cut Problem for Fixed k. Math. Oper. Res. 19(1): 24-37 (1994) - [j7]Olivier Goldschmidt, Alexan Takvorian:
An efficient graph planarization two-phase heuristic. Networks 24(2): 69-73 (1994) - [j6]Olivier Goldschmidt, Patrick Jaillet, Richard Lasota:
On reliability of graphs with node failures. Networks 24(4): 251-259 (1994) - 1993
- [j5]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): 305-310 (1993) - 1992
- [j4]Thomas A. Feo, Olivier Goldschmidt, Mallek Khellaf:
One-Half Approximation Algorithms for the k-Partition Problem. Oper. Res. 40(Supplement-1): S170-S173 (1992) - [j3]Vanolin F. Hurdle, Arjang A. Assad, Olivier Goldschmidt:
Bibliographic Section. Transp. Sci. 26(4): 355-361 (1992) - 1990
- [j2]Olivier Goldschmidt, Dorit S. Hochbaum:
A Fast Perfect-Matching Algorithm in Random Graphs. SIAM J. Discret. Math. 3(1): 48-57 (1990) - [j1]Olivier Goldschmidt, Dorit S. Hochbaum:
Asymptotically Optimal Linear Algorithm for the Minimum k-Cut in a Random Graph. SIAM J. Discret. Math. 3(1): 58-73 (1990)
1980 – 1989
- 1988
- [c1]Olivier Goldschmidt, Dorit S. Hochbaum:
Polynomial Algorithm for the k-Cut Problem. FOCS 1988: 444-451
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-07 01:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
