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

The aggregation closure is polyhedral for packing and cover..:

Pashkovich, Kanstantsin ; Poirrier, Laurent ; Pulyassary, Haripriya
Mathematical Programming.  195 (2021)  1-2 - p. 1135-1147 , 2021
Link: https://doi.org/10.1007/..
 
?
2

Bounds on the Number of 2-Level Polytopes, Cones, and Confi..:

Fiorini, Samuel ; Macchia, Marco ; Pashkovich, Kanstantsin
Discrete & Computational Geometry.  65 (2021)  3 - p. 587-600 , 2021
Link: https://doi.org/10.1007/..
 
?
3

Computing the nucleolus of weighted voting games in pseudo-..:

Pashkovich, Kanstantsin
Mathematical Programming.  195 (2021)  1-2 - p. 1123-1133 , 2021
Link: https://doi.org/10.1007/..
 
?
4

Three-dimensional stable matching with cyclic preferences:

Pashkovich, Kanstantsin ; Poirrier, Laurent
Optimization Letters.  14 (2020)  8 - p. 2615-2623 , 2020
Link: https://doi.org/10.1007/..
 
?
5

Computing the nucleolus of weighted cooperative matching ga..:

Könemann, Jochen ; Pashkovich, Kanstantsin ; Toth, Justin
Mathematical Programming.  183 (2020)  1-2 - p. 555-581 , 2020
Link: https://doi.org/10.1007/..
 
?
6

On the Approximability of the Stable Matching Problem with ..:

Chiang, Robert ; Pashkovich, Kanstantsin
Algorithmica.  82 (2020)  9 - p. 2668-2686 , 2020
Link: https://doi.org/10.1007/..
 
?
7

Approximating Stable Matchings with Ties of Bounded Size:

, In: Algorithmic Game Theory; Lecture Notes in Computer Science,
Koenemann, Jochen ; Pashkovich, Kanstantsin ; Tofigzade, Natig - p. 178-192 , 2020
Link: https://doi.org/10.1007/..
 
?
8

Simple games versus weighted voting games: bounding the cri..:

Hof, Frits ; Kern, Walter ; Kurz, Sascha..
Social Choice and Welfare.  54 (2020)  4 - p. 609-621 , 2020
Link: https://www.jstor.org/st..
 
?
9

On the Circuit Diameter of Some Combinatorial Polytopes:

Kafer, Sean ; Pashkovich, Kanstantsin ; Sanità, Laura
SIAM Journal on Discrete Mathematics.  33 (2019)  1 - p. 1-25 , 2019
Link: https://doi.org/10.1137/..
 
?
10

Computing the Nucleolus of Weighted Cooperative Matching Ga..:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Könemann, Jochen ; Pashkovich, Kanstantsin ; Toth, Justin - p. 413-426 , 2019
Link: https://doi.org/10.1007/..
 
?
11

Simple games versus weighted voting games: bounding the cri..:

Hof, Frits ; Kern, Walter ; Kurz, Sascha..
Social Choice and Welfare.  54 (2019)  4 - p. 609-621 , 2019
Link: https://doi.org/10.1007/..
 
?
12

Ideal Clutters That Do Not Pack:

Abdi, Ahmad ; Pashkovich, Kanstantsin ; Cornuéjols, Gérard
Mathematics of Operations Research.  43 (2018)  2 - p. 533-553 , 2018
Link: https://www.jstor.org/st..
 
?
13

Enumeration of 2-level polytopes:

Bohn, Adam ; Faenza, Yuri ; Fiorini, Samuel...
Mathematical Programming Computation.  11 (2018)  1 - p. 173-210 , 2018
Link: https://doi.org/10.1007/..
 
?
14

Delta Minors, Delta Free Clutters, and Entanglement:

Abdi, Ahmad ; Pashkovich, Kanstantsin
SIAM Journal on Discrete Mathematics.  32 (2018)  3 - p. 1750-1774 , 2018
Link: https://doi.org/10.1137/..
 
?
15

Smaller Extended Formulations for the Spanning Tree Polytop..:

Fiorini, Samuel ; Huynh, Tony ; Joret, Gwenaël.
Discrete & Computational Geometry.  57 (2017)  3 - p. 757-761 , 2017
Link: https://doi.org/10.1007/..
 
1-15