Oleg Prokopyev

Professor

University of Pittsburgh

United States

Research Interests

Explore related searches

Professors in United States

Contact this professor

Get a free first email built on one of their papers, ready for you to edit and send yourself.

About

Oleg Prokopyev is a Professor at the University of Pittsburgh, USA. His research focuses on optimization and network design, including topics such as bilevel optimization, network resilience, and centrality measures in graph theory. He has recently published articles on interdicting dense clusters in networks, condition-based maintenance, and complexity in bilevel linear programming.

Articles (17)

Year:

2025

Year:

2025

Year:

2025

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2022

Year:

2022

Year:

2022

Year:

2022

Collaborators (5)

Sergiy Butenko

Professor

Texas A&M University

UNITED STATES

View details

Sergey Ketkov

University of Zurich

SWITZERLAND

View details

Dmytro Matsypura

University of Sydney Business School

AUSTRALIA

View details

Shaoning Han

University of Southern California

UNITED STATES

View details

Lisa Maillart

University of Pittsburgh

UNITED STATES

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Oleg Prokopyev

Research Interests

Explore related searches

Contact this professor

About

Articles (17)

On Interdicting Dense Clusters in a Network

Ultra-small world detection in networks: subgraphs with prescribed distance distributions

Bilevel optimization approach for fuel treatment planning

Optimal Condition-Based Maintenance via a Mobile Maintenance Resource

Optimal Condition-Based Mission Abort Decisions

Finding the most degree-central walks and paths in a graph: Exact and heuristic approaches

On designing networks resilient to clique blockers

Planning of life-depleting preventive maintenance activities with replacements

Finding groups with maximum betweenness centrality via integer programming with random path sampling

Exact solution approaches for a class of bilevel fractional programs

On complexity of finding strong-weak solutions in bilevel linear programming

Min-Max-Min Optimization with Smooth and Strongly Convex Objectives

Min-Max-Min Optimization with Smooth and Strongly Convex Objectives

On maximum ratio clique relaxations

Fractional 0–1 programming and submodularity

Learning in Sequential Bilevel Linear Programming

On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs

Collaborators (5)

Sergiy Butenko

Sergey Ketkov

Dmytro Matsypura

Shaoning Han

Lisa Maillart

Make your next move.