Oleg A. Prokopyev

According to our database1, Oleg A. Prokopyev authored at least 101 papers between 2004 and 2022.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs.
Eur. J. Oper. Res., 2022

Optimal Age-Replacement in Anticipation of Time-Dependent, Unpunctual Policy Implementation.
IEEE Trans. Reliab., 2021

Optimization Letters Best Paper Award for 2019.
Optim. Lett., 2021

A Mixed-Integer Fractional Optimization Approach to Best Subset Selection.
INFORMS J. Comput., 2021

Age-replacement policies under age-dependent replacement costs.
IISE Trans., 2021

Analysis of process flexibility designs under disruptions.
IISE Trans., 2021

Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback.
Decis. Anal., 2021

Data-Driven Combinatorial Optimization with Incomplete Information: a Distributionally Robust Optimization Approach.
CoRR, 2021

An approach to the distributionally robust shortest path problem.
Comput. Oper. Res., 2021

On exact solution approaches for bilevel quadratic 0-1 knapsack problem.
Ann. Oper. Res., 2021

Solving a class of feature selection problems via fractional 0-1 programming.
Ann. Oper. Res., 2021

Optimization Letters Best Paper Award for 2018.
Optim. Lett., 2020

Two-stage stochastic minimum s - t cut problems: Formulations, complexity and decomposition algorithms.
Networks, 2020

On the maximum small-world subgraph problem.
Eur. J. Oper. Res., 2020

On Bilevel Optimization with Inexact Follower.
Decis. Anal., 2020

Sequence Independent Lifting for the Set of Submodular Maximization Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2020

Optimization of Cascading Processes in Arbitrary Networks with Stochastic Interactions.
IEEE Trans. Netw. Sci. Eng., 2019

Optimization Letters Best Paper Award for 2017.
Optim. Lett., 2019

On bilevel minimum and bottleneck spanning tree problems.
Networks, 2019

Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations.
J. Glob. Optim., 2019

Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function.
Oper. Res., 2019

Sequential Interdiction with Incomplete Information and Learning.
Oper. Res., 2019

Finding Critical Links for Closeness Centrality.
INFORMS J. Comput., 2019

On exact solution approaches for the longest induced path problem.
Eur. J. Oper. Res., 2019

A note on linearized reformulations for a class of bilevel linear integer problems.
Ann. Oper. Res., 2019

Optimal sequencing of heterogeneous, non-instantaneous interventions.
Ann. Oper. Res., 2019

Restart Strategies.
Proceedings of the Handbook of Heuristics., 2018

Optimization Letters Best Paper Award for 2016.
Optim. Lett., 2018

On maximum degree-based γ-quasi-clique problem: Complexity and exact approaches.
Networks, 2018

Critical arcs detection in influence networks.
Networks, 2018

Dynamic Abandon/Extract Decisions for Failed Cardiac Leads.
Manag. Sci., 2018

On a class of bilevel linear mixed-integer programs in adversarial settings.
J. Glob. Optim., 2018

Optimal Design of the Seasonal Influenza Vaccine with Manufacturing Autonomy.
INFORMS J. Comput., 2018

Wildfire fuel management: Network-based models and optimization of prescribed burning.
Eur. J. Oper. Res., 2018

On Greedy and Strategic Evaders in Sequential Interdiction Settings with Incomplete Information.
CoRR, 2018

Finding groups with maximum betweenness centrality.
Optim. Methods Softw., 2017

Robustness of solutions to critical node detection problems with imperfect data: a computational study.
Optim. Methods Softw., 2017

Optimization Letters Best Paper Award for 2015.
Optim. Lett., 2017

Fractional 0-1 programming: applications and algorithms.
J. Glob. Optim., 2017

A simple greedy heuristic for linear assignment interdiction.
Ann. Oper. Res., 2017

A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems.
Oper. Res. Lett., 2016

On provably best construction heuristics for hard combinatorial optimization problems.
Networks, 2016

Irregular polyomino tiling via integer programming with application in phased array antenna design.
J. Glob. Optim., 2016

The Surgical Patient Routing Problem: A Central Planner Approach.
INFORMS J. Comput., 2016

Sequential Shortest Path Interdiction with Incomplete Information.
Decis. Anal., 2016

Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs.
Comput. Optim. Appl., 2016

Exact solution approaches for bilevel assignment problems.
Comput. Optim. Appl., 2016

Scheduling Preventive Maintenance as a Function of an Imperfect Inspection Interval.
IEEE Trans. Reliab., 2015

On speed scaling via integer programming.
Oper. Res. Lett., 2015

Critical nodes for distance-based connectivity and related problems in graphs.
Networks, 2015

Exact solution approach for a class of nonlinear bilevel knapsack problems.
J. Glob. Optim., 2015

A note on constraint aggregation and value functions for two-stage stochastic integer programs.
Discret. Optim., 2015

Maximizing the Lifetime of Query-Based Wireless Sensor Networks.
ACM Trans. Sens. Networks, 2014

On greedy approximation algorithms for a class of two-stage stochastic assignment problems.
Optim. Methods Softw., 2014

Optimization Letters Best Paper Award.
Optim. Lett., 2014

Preface: Honoring the 60th birthday of Panos M. Pardalos.
J. Glob. Optim., 2014

An integer programming framework for critical elements detection in graphs.
J. Comb. Optim., 2014

Optimal Implantable Cardioverter Defibrillator (ICD) Generator Replacement.
INFORMS J. Comput., 2014

Finding maximum subgraphs with relatively large vertex connectivity.
Eur. J. Oper. Res., 2014

Optim. Lett., 2013

A global optimization algorithm for solving the minimum multiple ratio spanning tree problem.
J. Glob. Optim., 2013

On a Level-Set Characterization of the Value Function of an Integer Program and Its Application to Stochastic Programming.
Oper. Res., 2013

Stochastic Operating Room Scheduling for High-Volume Specialties Under Block Booking.
INFORMS J. Comput., 2013

On Maximum Speedup Ratio of Restart Algorithm Portfolios.
INFORMS J. Comput., 2013

On characterization of maximal independent sets via quadratic optimization.
J. Heuristics, 2013

Two-stage quadratic integer programs with stochastic right-hand sides.
Math. Program., 2012

On algorithm portfolios and restart strategies.
Oper. Res. Lett., 2011

Optimizing the Societal Benefits of the Annual Influenza Vaccine: A Stochastic Programming Approach.
Oper. Res., 2011

Integrated design and operation of remnant inventory supply chains under uncertainty.
Eur. J. Oper. Res., 2011

How much do we "pay" for using default parameters?
Comput. Optim. Appl., 2011

Managing patient backlog in a surgical suite that uses a block-booking scheduling system.
Proceedings of the Winter Simulation Conference 2011, 2011

The bilevel knapsack problem with stochastic right-hand sides.
Oper. Res. Lett., 2010

Finding checkerboard patterns via fractional 0-1 programming.
J. Comb. Optim., 2010

Solving the Order-Preserving Submatrix Problem via Integer Programming.
INFORMS J. Comput., 2010

Optimization of minimum set of protein-DNA interactions: a quasi exact solution with minimum over-fitting.
Bioinform., 2010

Fractional Zero-One Programming.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Selective support vector machines.
J. Comb. Optim., 2009

The equitable dispersion problem.
Eur. J. Oper. Res., 2009

Checking solvability of systems of interval linear equations and inequalities via mixed integer programming.
Eur. J. Oper. Res., 2009

On equivalent reformulations for absolute value equations.
Comput. Optim. Appl., 2009

Analyzing the performance of randomized information sharing.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

Data Structures and Algorithms.
Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

Solving weighted MAX-SAT via global equilibrium search.
Oper. Res. Lett., 2008

Global equilibrium search applied to the unconstrained binary quadratic optimization problem.
Optim. Methods Softw., 2008

Biclustering in data mining.
Comput. Oper. Res., 2008

Optim. Methods Softw., 2007

An optimization-based approach for data classification.
Optim. Methods Softw., 2007

J. Glob. Optim., 2007

Streaming cache placement problems: complexity and algorithms.
Int. J. Comput. Sci. Eng., 2007

Maintaining shared belief in a large multiagent team.
Proceedings of the 10th International Conference on Information Fusion, 2007

Book review.
Optim. Methods Softw., 2006

Optimal solutions to minimum total energy broadcasting problem in wireless ad hoc networks.
J. Comb. Optim., 2006

Lower Bound Improvement and Forcing Rule for Quadratic Binary Programming.
Comput. Optim. Appl., 2006

Electroencephalogram (EEG) time series classification: Applications in epilepsy.
Ann. Oper. Res., 2006

On complexity of unconstrained hyperbolic 0-1 programming problems.
Oper. Res. Lett., 2005

Computational Comparison Studies of Quadratic Assignment Like Formulations for the In Silico Sequence Selection Problem in De Novo Protein Design.
J. Comb. Optim., 2005

Feature Selection for Consistent Biclustering via Fractional 0-1 Programming.
J. Comb. Optim., 2005

A new linearization technique for multi-quadratic 0-1 programming problems.
Oper. Res. Lett., 2004

Seizure warning algorithm based on optimization and nonlinear dynamics.
Math. Program., 2004

Minimum elsilon-equivalent Circuit Size Problem.
J. Comb. Optim., 2004

On Approximability of Boolean Formula Minimization.
J. Comb. Optim., 2004