The following pages link to Gautier Stauffer (Q408179):
Displaying 29 items.
- (Q322423) (redirect page) (← links)
- Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales (Q322424) (← links)
- On the recognition of fuzzy circular interval graphs (Q408180) (← links)
- Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube (Q635513) (← links)
- On the facets of the stable set polytope of quasi-line graphs (Q635515) (← links)
- The \(p\)-median polytope of \(Y\)-free graphs: An application of the matching theory (Q943797) (← links)
- Clique-circulants and the stable set polytope of fuzzy circular interval graphs (Q948961) (← links)
- The stable set polytope of quasi-line graphs (Q949780) (← links)
- Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem (Q1631181) (← links)
- On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs (Q1880259) (← links)
- Separation routine and extended formulations for the stable set problem in claw-free graphs (Q2039230) (← links)
- The stochastic shortest path problem: a polyhedral combinatorics perspective (Q2183321) (← links)
- Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments (Q2273901) (← links)
- The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing (Q2661539) (← links)
- On the facets of stable set polytopes of circular interval graphs (Q2673814) (← links)
- (Q3109934) (← links)
- Using the economical order quantity formula for inventory control in one‐warehouse multiretailer systems (Q3120559) (← links)
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs (Q3503841) (← links)
- Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs (Q3596357) (← links)
- France Telecom workforce scheduling problem: a challenge (Q3644813) (← links)
- Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property (Q4910807) (← links)
- Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints (Q5359123) (← links)
- (Q5365022) (← links)
- (Q5365068) (← links)
- Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition (Q5501925) (← links)
- (Q5708520) (← links)
- (Q5743477) (← links)
- How many matchings cover the nodes of a graph? (Q6201927) (← links)
- Should Sports Professionals Consider Their Adversary's Strategy? A Case Study of Match Play in Golf (Q6513235) (← links)
