Faculty

Institution

Unit

Venue

Hamidreza Validi

Assistant Professor

Texas Tech University

Affiliations

Edward E. Whitacre Jr. College of Engineering

Department of Industrial, Manufacturing, & Systems Engineering

Hamidreza Validi is currently serving as an Industrial, Manufacturing, & Systems Engineering Assistant Professor at Texas Tech University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Hamidreza Validi

Texas Tech University

Assistant Professor

You can click a keyword to filter the displayed items

applied mathematics mathematical optimization graph theory operations research mathematical programming computational optimization combinatorial optimization discrete algorithms discrete optimization political science systems engineering computer engineering quantum computing design optimization engineering optimization optimization problems integer optimization combinatorial problems political districting optimal design network science virtual reality numerical analysis social network analysis evolutionary computation global optimization combinatorial theory quantum science global networks cluster computing telecommunication networks networked system design intelligent computing low latency planar graphs network optimization mixed integer optimization quantum optimization algorithms quantum algorithms graph processing graph databases cluster technology graph analysis data repository branch-and-bound algorithms time-sensitive networking physical layer next generation computing biomedical modeling contiguity constraints political districting models cut edges low-latency virtual backbones linear-size formulations quantum context set partitioning problem polytime preprocess algorithm large-scale social networks cut-based mixed integer folding preprocess qubo reformulations low-diameter clusters precise allocations

Notable Scholarly Works

Notable Federal Grants

Collaborators

A Cut-Based Mixed Integer Programming Formulation for the Hop-Constrained Cheapest Path Problem. Optimization Letters (2026)

approximation theorycombinatorial optimizationcut-based mixed integercomputational mathematicsinteger optimizationmixed integer optimizationsystems engineeringdiscrete optimizationoperations researchglobal optimizationapplied mathematicscomputational optimizationmathematical programmingmathematical optimization

Code and Data Repository for Partitioning a Graph Into Low-Diameter Clusters. INFORMS journal on computing (2026)

graph analysiscomputer sciencecluster computinglow-diameter clustersclusteringgraph theorydata sciencegraph processingcluster technologydiscrete algorithmsgraph databasesdata repositoryglobal networks

A Folding Preprocess for the Max K-Cut Problem. Optimization Letters (2025)

combinatorial optimizationcombinatoricsdiscrete optimizationcomputational optimizationapplied mathematicscombinatorial problemsfolding preprocessdiscrete algorithmscomputational geometry

Characterizing Qubo Reformulations of the Max-K-Cut Problem for Quantum Computing. ArXiv.org (2025)

combinatorial theorycomputer sciencequantum computingcomputational complexityqubo reformulationsquantum algorithmsquantum optimization algorithmsmathematicsquantum information sciencediscrete algorithmsquantum science

Compact Mixed Integer Programming Formulations for the Minimum Biclique Cover Problem. Networks (2025)

design optimizationdiscrete mathematicscomputational complexitycombinatorial optimizationinteger optimizationmathematical programmingbranch-and-bound algorithmsdiscrete optimizationoperations researchapplied mathematicscombinatorial problemsmathematicsengineering optimization

Maximizing Engagement in Large-Scale Social Networks. INFORMS Journal on Optimization (2024)

Samuel KrogerHamidreza ValidiIllya V. Hicks

large-scale social networksnetwork optimizationcommunicationsocial network analysis

Optimal Design of Vaccination Policies: A Case Study for Newfoundland and Labrador. Operations Research Letters (2024)

Faraz KhoshbakhtianHamidreza ValidiMario VentrescaDionne Aleman

health policyoptimal designoperations researchpublic healthpublic policy

Strengthened Mip Formulations for the Liver Region Redesign Models of Akshat Et Al.. Optimization Letters (2024)

Aysenur KaragozRuofeng LiuHamidreza Validi

biomedical modelingbiomedical engineeringmip formulations

A Polytime Preprocess Algorithm for the Maximum Independent Set Problem. Optimization Letters (2023)

Samuel KrogerHamidreza ValidiIllya V. Hicks

polytime preprocess algorithmgraph theorymathematical optimizationapplied mathematics

Linear-Size Formulations for Connected Planar Graph Partitioning and Political Districting. Optimization Letters (2023)

Jack ZhangHamidreza ValidiAustin BuchananIllya V. Hicks

linear-size formulationsgraph theorypolitical districtingcomputational optimizationapplied mathematicsplanar graphsmathematical optimization

1
2
10 / page

Hamidreza Validi

Assistant Professor

Texas Tech University

Affiliations

Edward E. Whitacre Jr. College of Engineering

Department of Industrial, Manufacturing, & Systems Engineering

Hamidreza Validi is currently serving as an Industrial, Manufacturing, & Systems Engineering Assistant Professor at Texas Tech University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Hamidreza Validi

Texas Tech University

Assistant Professor

You can click a keyword to filter the displayed items

Notable Scholarly Works

Notable Federal Grants

Collaborators

A Cut-Based Mixed Integer Programming Formulation for the Hop-Constrained Cheapest Path Problem. Optimization Letters (2026)

Code and Data Repository for Partitioning a Graph Into Low-Diameter Clusters. INFORMS journal on computing (2026)

A Folding Preprocess for the Max K-Cut Problem. Optimization Letters (2025)

combinatorial optimizationcombinatoricsdiscrete optimizationcomputational optimizationapplied mathematicscombinatorial problemsfolding preprocessdiscrete algorithmscomputational geometry

Characterizing Qubo Reformulations of the Max-K-Cut Problem for Quantum Computing. ArXiv.org (2025)

Compact Mixed Integer Programming Formulations for the Minimum Biclique Cover Problem. Networks (2025)

Maximizing Engagement in Large-Scale Social Networks. INFORMS Journal on Optimization (2024)

Samuel KrogerHamidreza ValidiIllya V. Hicks

large-scale social networksnetwork optimizationcommunicationsocial network analysis

Optimal Design of Vaccination Policies: A Case Study for Newfoundland and Labrador. Operations Research Letters (2024)

Faraz KhoshbakhtianHamidreza ValidiMario VentrescaDionne Aleman

health policyoptimal designoperations researchpublic healthpublic policy

Strengthened Mip Formulations for the Liver Region Redesign Models of Akshat Et Al.. Optimization Letters (2024)

Aysenur KaragozRuofeng LiuHamidreza Validi

biomedical modelingbiomedical engineeringmip formulations

A Polytime Preprocess Algorithm for the Maximum Independent Set Problem. Optimization Letters (2023)

Samuel KrogerHamidreza ValidiIllya V. Hicks

polytime preprocess algorithmgraph theorymathematical optimizationapplied mathematics

Linear-Size Formulations for Connected Planar Graph Partitioning and Political Districting. Optimization Letters (2023)

Jack ZhangHamidreza ValidiAustin BuchananIllya V. Hicks

linear-size formulationsgraph theorypolitical districtingcomputational optimizationapplied mathematicsplanar graphsmathematical optimization

1
2
10 / page

Similar Faculty Members

Karthekeyan Chandrasekaran

Institution

University of Illinois Urbana-Champaign

operations research

applied mathematics

Giacomo Nannicini

Institution

University of Southern California

computer engineering

dynamic programming

Amitabh Basu

Institution

Johns Hopkins University

applied mathematics

mathematical optimization

Alina Ene

Institution

Boston University

analysis of algorithm

computational optimization

Matthias Koeppe

Institution

University of California, Davis

operations research

computational complexity

Dorit Hochbaum

Institution

University of California, Berkeley

applied mathematics

computer science

Mohit Singh

Institution

Georgia Institute of Technology

continuous optimization

operations research

Kent Quanrud

Institution

Purdue University

discrete algorithm

approximation method

K. Subramani

Institution

West Virginia University

computer science

applied mathematics

Nisheeth Vishnoi

Institution

Yale University

applied mathematics

computer science

Similar Faculty Members

Karthekeyan Chandrasekaran

Institution

University of Illinois Urbana-Champaign

operations research

applied mathematics

Giacomo Nannicini

Institution

University of Southern California

computer engineering

dynamic programming

Amitabh Basu

Institution

Johns Hopkins University

applied mathematics

mathematical optimization

Alina Ene

Institution

Boston University

analysis of algorithm

computational optimization

Matthias Koeppe

Institution

University of California, Davis

operations research

computational complexity

Dorit Hochbaum

Institution

University of California, Berkeley

applied mathematics

computer science

Mohit Singh

Institution

Georgia Institute of Technology

continuous optimization

operations research

Kent Quanrud

Institution

Purdue University

discrete algorithm

approximation method

K. Subramani

Institution

West Virginia University

computer science

applied mathematics

Nisheeth Vishnoi

Institution

Yale University

applied mathematics

computer science