Hamidreza Validi

According to our database, Hamidreza Validi authored at least 10 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

A polytime preprocess algorithm for the maximum independent set problem.

Samuel Kroger, Hamidreza Validi, Illya V. Hicks

Optim. Lett., March, 2024

Linear-size formulations for connected planar graph partitioning and political districting.

Jack Zhang, Hamidreza Validi, Austin Buchanan, Illya V. Hicks

Optim. Lett., January, 2024

The set partitioning problem in a quantum context.

Rafael Cação, Lucas R. C. T. Cortez, Jackson Forner, Hamidreza Validi, Ismael R. de Farias Jr., Illya V. Hicks

Optim. Lett., January, 2024

2023

On relaxations of the max <i>k</i>-cut problem formulations.

Ramin Fakhimi, Hamidreza Validi, Illya V. Hicks, Tamás Terlaky, Luis F. Zuluaga

Oper. Res. Lett., September, 2023

2022

Political districting to minimize cut edges.

Hamidreza Validi, Austin Buchanan

Math. Program. Comput., 2022

Imposing Contiguity Constraints in Political Districting Models.

Hamidreza Validi, Austin Buchanan, Eugene Lykhovyd

Oper. Res., 2022

Mixed integer linear optimization formulations for learning optimal binary classification trees.

Brandon Alston, Hamidreza Validi, Illya V. Hicks

CoRR, 2022

Graph Representation of Computer Network Resources for Precise Allocations.

Stuart Baxley, Deniz Gurkan, Hamidreza Validi, Illya V. Hicks

Proceedings of the 31st International Conference on Computer Communications and Networks, 2022

2020

The Optimal Design of Low-Latency Virtual Backbones.

Hamidreza Validi, Austin Buchanan

INFORMS J. Comput., 2020

2019

A note on "A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs".

Hamidreza Validi, Austin Buchanan

Networks, 2019