Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Faenza, Yuri
74  Ergebnisse:
Personensuche X
?
1

Discovering Opportunities in New York City's Discovery Prog..:

, In: Proceedings of the 24th ACM Conference on Economics and Computation,
Faenza, Yuri ; Gupta, Swati ; Zhang, Xuan - p. 585 ff. , 2023
Link: https://dl.acm.org/doi/1..
 
?
2

The simultaneous semi-random model for TSP:

Balkanski, Eric ; Faenza, Yuri ; Kubik, Mathieu
Mathematical Programming.  , 2023
Link: https://doi.org/10.1007/..
 
?
3

The Power of Greedy for Online Minimum Cost Matching on the..:

, In: Proceedings of the 24th ACM Conference on Economics and Computation,
Balkanski, Eric ; Faenza, Yuri ; Périvier, Noémie - p. 185-205 , 2023
Link: https://dl.acm.org/doi/1..
 
?
4

On inequalities with bounded coefficients and pitch for the..:

Bienstock, Daniel ; Faenza, Yuri ; Malinović, Igor...
Discrete Optimization.  44 (2022)  - p. 100567 , 2022
Link: https://doi.org/10.1016/..
 
?
5

Understanding Popular Matchings via Stable Matchings:

Cseh, Ágnes ; Faenza, Yuri ; Kavitha, Telikepalli.
SIAM Journal on Discrete Mathematics.  36 (2022)  1 - p. 188-213 , 2022
Link: https://doi.org/10.1137/..
 
?
6

Approximation algorithms for the generalized incremental kn..:

Faenza, Yuri ; Segev, Danny ; Zhang, Lingyi
Mathematical Programming.  198 (2022)  1 - p. 27-83 , 2022
Link: https://doi.org/10.1007/..
 
?
7

Affinely representable lattices, stable matchings, and choi..:

Faenza, Yuri ; Zhang, Xuan
Mathematical Programming.  197 (2022)  2 - p. 721-760 , 2022
Link: https://doi.org/10.1007/..
 
?
8

Slack matrices, k-products, and 2-level polytopes:

Aprile, Manuel ; Conforti, Michele ; Fiorini, Samuel...
Discrete Applied Mathematics.  , 2022
Link: https://doi.org/10.1016/..
 
?
9

The Simultaneous Semi-random Model for TSP:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Balkanski, Eric ; Faenza, Yuri ; Kubik, Mathieu - p. 43-56 , 2022
Link: https://doi.org/10.1007/..
 
?
10

Affinely Representable Lattices, Stable Matchings, and Choi..:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Faenza, Yuri ; Zhang, Xuan - p. 89-103 , 2021
Link: https://doi.org/10.1007/..
 
?
11

Pitch, extension complexity, and covering problems:

Bienstock, Daniel ; Faenza, Yuri ; Zhang, Xuan
Operations Research Letters.  49 (2021)  3 - p. 357-364 , 2021
Link: https://doi.org/10.1016/..
 
?
12

(Un)stable matchings with blocking costs:

Faenza, Yuri ; Mourtos, Ioannis ; Samaris, Michalis.
Operations Research Letters.  49 (2021)  5 - p. 655-662 , 2021
Link: https://doi.org/10.1016/..
 
?
13

Extended formulations from communication protocols in outpu..:

Aprile, Manuel ; Faenza, Yuri
Mathematical Programming.  183 (2020)  1-2 - p. 41-59 , 2020
Link: https://doi.org/10.1007/..
 
?
14

New limits of treewidth-based tractability in optimization:

Faenza, Yuri ; Muñoz, Gonzalo ; Pokutta, Sebastian
Mathematical Programming.  191 (2020)  2 - p. 559-594 , 2020
Link: https://doi.org/10.1007/..
 
?
15

Separation routine and extended formulations for the stable..:

Faenza, Yuri ; Oriolo, Gianpaolo ; Stauffer, Gautier
Mathematical Programming.  188 (2020)  1 - p. 53-84 , 2020
Link: https://doi.org/10.1007/..
 
1-15