Author of the publication

A mixed integer linear program to compress transition probability matrices in Markov chain bootstrapping.

, , , , and . Ann. Oper. Res., 248 (1-2): 163-187 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A combinatorial optimization approach to scenario filtering in portfolio selection., , , and . Comput. Oper. Res., (2022)Network flow methods for electoral systems., , , , and . Networks, 59 (1): 73-88 (2012)Mathematical Programming formulations for the efficient solution of the $k$-sum approval voting problem., , , and . CoRR, (2017)Locating median paths on connected outerplanar graphs., , , and . Networks, 57 (3): 294-307 (2011)Range minimization problems in path-facility location on trees., , and . CTW, page 231-234. (2011)A mixed integer linear program to compress transition probability matrices in Markov chain bootstrapping., , , , and . Ann. Oper. Res., 248 (1-2): 163-187 (2017)Weighted Voronoi Region Algorithms for Political Districting., , and . Frontiers of Electronic Voting, volume 07311 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2007)Mathematical political districting taking care of minority groups., , , and . Ann. Oper. Res., 305 (1): 375-402 (2021)The Forest Wrapping Problem on Outerplanar Graphs., , and . WG, volume 2573 of Lecture Notes in Computer Science, page 345-354. Springer, (2002)Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria., , , and . Networks, 67 (1): 69-81 (2016)