Olivier Goldschmidt

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem European Journal of Operational Research	2025-05-20	Paper
Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques Networks	2025-01-08	Paper
SONET/SDH ring assignment with capacity constraints Discrete Applied Mathematics	2003-07-30	Paper
The SONET edge‐partition problem Networks	2003-03-10	Paper
Combinatorial issues in air traffic optimization Transportation Science	2002-04-17	Paper
A new and improved algorithm for the 3-cut problem Operations Research Letters	1999-03-18	Paper
On finding a biconnected spanning planar subgraph with applications to the facilities layout problem European Journal of Operational Research	1999-02-22	Paper
Local optimality and its application on independent sets for \(k\)-claw free graphs Journal of Combinatorial Optimization	1997-12-17	Paper
\(k\)-edge subgraph problems Discrete Applied Mathematics	1997-09-07	Paper
On locally optimal independent sets and vertex covers	1997-04-21	Paper
Approximation Algorithms for the <i>k</i>-Clique Covering Problem SIAM Journal on Discrete Mathematics	1997-02-26	Paper
Randomized methods for the number partitioning problem Computers & Operations Research	1997-01-06	Paper
scientific article; zbMATH DE number 698819 (Why is no real title available?)	1994-12-01	Paper
A modified greedy heuristic for the set covering problem with improved worst case bound Information Processing Letters	1994-09-25	Paper
On reliability of graphs with node failures Networks	1994-08-29	Paper
A Polynomial Algorithm for the k-cut Problem for Fixed k Mathematics of Operations Research	1994-05-18	Paper
An efficient graph planarization two‐phase heuristic Networks	1994-03-24	Paper
One-Half Approximation Algorithms for the k-Partition Problem Operations Research	1992-06-28	Paper
Asymptotically Optimal Linear Algorithm for the Minimum <i>k</i>-Cut in a Random Graph SIAM Journal on Discrete Mathematics	1992-06-25	Paper
A Fast Perfect-Matching Algorithm in Random Graphs SIAM Journal on Discrete Mathematics	1990-01-01	Paper

Research outcomes over time

This page was built for person: Olivier Goldschmidt