| Publication | Date of Publication | Type |
|---|
How many matchings cover the nodes of a graph?
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
| Enhancing PGA Tour Performance: Leveraging ShotlinkTM Data for Optimization and Prediction | 2023-09-01 | Paper |
On the facets of stable set polytopes of circular interval graphs
Annals of Operations Research | 2022-06-13 | Paper |
Separation routine and extended formulations for the stable set problem in claw-free graphs
Mathematical Programming. Series A. Series B | 2021-07-02 | Paper |
The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing
Operations Research Letters | 2021-04-07 | Paper |
The stochastic shortest path problem: a polyhedral combinatorics perspective
European Journal of Operational Research | 2020-05-26 | Paper |
Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments
European Journal of Operational Research | 2019-09-18 | Paper |
| Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs | 2019-05-10 | Paper |
Using the economical order quantity formula for inventory control in one-warehouse multiretailer systems
Naval Research Logistics | 2019-03-05 | Paper |
Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem
Mathematical Methods of Operations Research | 2018-12-05 | Paper |
| A simple and fast 2-approximation algorithm for the one-warehouse multi-retailers problem | 2017-09-29 | Paper |
| scientific article; zbMATH DE number 6783420 (Why is no real title available?) | 2017-09-29 | Paper |
Fast approximation algorithms for the one-warehouse multi-retailer problem under general cost structures and capacity constraints
Mathematics of Operations Research | 2017-09-22 | Paper |
Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales
European Journal of Operational Research | 2016-10-07 | Paper |
Solving the weighted stable set problem in claw-free graphs via decomposition
Journal of the ACM | 2015-08-14 | Paper |
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
On the recognition of fuzzy circular interval graphs
Discrete Mathematics | 2012-03-29 | Paper |
| Stable sets in claw-free graphs: a journey through algorithms and polytopes | 2012-01-26 | Paper |
Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube
Operations Research Letters | 2011-08-19 | Paper |
On the facets of the stable set polytope of quasi-line graphs
Operations Research Letters | 2011-08-19 | Paper |
France Telecom workforce scheduling problem: a challenge
RAIRO - Operations Research | 2009-11-12 | Paper |
France Telecom workforce scheduling problem: a challenge
RAIRO - Operations Research | 2009-11-12 | Paper |
The stable set polytope of quasi-line graphs
Combinatorica | 2008-10-21 | Paper |
Clique-circulants and the stable set polytope of fuzzy circular interval graphs
Mathematical Programming. Series A. Series B | 2008-10-16 | Paper |
The \(p\)-median polytope of \(Y\)-free graphs: An application of the matching theory
Operations Research Letters | 2008-09-10 | Paper |
A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
| scientific article; zbMATH DE number 2230228 (Why is no real title available?) | 2005-11-18 | Paper |
On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
Mathematical Methods of Operations Research | 2004-09-22 | Paper |
Should Sports Professionals Consider Their Adversary's Strategy? A Case Study of Match Play in Golf
(available as arXiv preprint) | N/A | Paper |
