Olivier Goldschmidt

Publications

861

Citations

H-Index

1988

Active since

Affiliations

University of California, Berkeley(Current)

The University of Texas at Austin

RNET Technologies (United States)

Southern Methodist University

Olivier Goldschmidt is an author at University of California, Berkeley specializing in engineering, combinatorial optimization, and discrete mathematics.

ORCID

Top concepts

EngineeringCombinatorial OptimizationDiscrete MathematicsGraph TheoryComputer ScienceMathematical ProgrammingNetwork ScienceNetwork AnalysisDiscrete OptimizationComputational Geometry

Publications per year

1988–2011

Publications

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

Olivier Goldschmidt, Dorit S. Hochbaum · Mathematics of Operations Research · 1994 · 228 citations

Mathematical Programming, Engineering, Computational Complexity +22

Polynomial algorithm for the k-cut problem

Olivier Goldschmidt, Dorit S. Hochbaum · 1988 · 192 citations

Mathematical Programming, Engineering, Computational Complexity +17

SONET/SDH ring assignment with capacity constraints

Olivier Goldschmidt, Alexandre Laugier, Eli V. Olinick · Discrete Applied Mathematics · 2002 · 66 citations

Mathematical Programming, Engineering, Circuit Design +5

The SONET edge‐partition problem

Olivier Goldschmidt, Dorit S. Hochbaum, Asaf Levin et al. · Networks · 2002 · 62 citations

Engineering, Network Analysis, Education +16

A modified greedy heuristic for the Set Covering problem with improved worst case bound

Olivier Goldschmidt, Dorit S. Hochbaum, Gang Yu · Information Processing Letters · 1993 · 42 citations

Mathematical Programming, Covering Problems, Engineering +10

Rows per page

1–5 of 15