Olivier Goldschmidt

Available identifiers

Publication	Date of Publication	Type
Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques	2025-01-08	Paper
SONET/SDH ring assignment with capacity constraints	2003-07-30	Paper
The SONET edge‐partition problem	2003-03-10	Paper
Combinatorial issues in air traffic optimization	2002-04-17	Paper
A new and improved algorithm for the 3-cut problem	1999-03-18	Paper
On finding a biconnected spanning planar subgraph with applications to the facilities layout problem	1999-02-22	Paper
Local optimality and its application on independent sets for \(k\)-claw free graphs	1997-12-17	Paper
\(k\)-edge subgraph problems	1997-09-07	Paper
On locally optimal independent sets and vertex covers	1997-04-21	Paper
Approximation Algorithms for the k-Clique Covering Problem	1997-02-26	Paper
Randomized methods for the number partitioning problem	1997-01-06	Paper
https://portal.mardi4nfdi.de/entity/Q4314864	1994-12-01	Paper
A modified greedy heuristic for the set covering problem with improved worst case bound	1994-09-25	Paper
On reliability of graphs with node failures	1994-08-29	Paper
A Polynomial Algorithm for the k-cut Problem for Fixed k	1994-05-18	Paper
An efficient graph planarization two‐phase heuristic	1994-03-24	Paper
One-Half Approximation Algorithms for the k-Partition Problem	1992-06-28	Paper
Asymptotically Optimal Linear Algorithm for the Minimum k-Cut in a Random Graph	1992-06-25	Paper
A Fast Perfect-Matching Algorithm in Random Graphs	1990-01-01	Paper

This page was built for person: Olivier Goldschmidt