default search action
Oleg A. Prokopyev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j109]Tomás Lagos, Junyeong Choi, Brittany Segundo, Jianbang Gan, Lewis Ntaimo, Oleg A. Prokopyev:
Bilevel optimization approach for fuel treatment planning. Eur. J. Oper. Res. 320(1): 205-218 (2025) - 2024
- [j108]Tomás Lagos, Oleg A. Prokopyev, Alexander Veremyev:
Finding groups with maximum betweenness centrality via integer programming with random path sampling. J. Glob. Optim. 88(1): 199-232 (2024) - [i4]Sergey S. Ketkov, Oleg A. Prokopyev:
On a class of interdiction problems with partition matroids: complexity and polynomial-time algorithms. CoRR abs/2401.12010 (2024) - 2023
- [j107]Sergey S. Ketkov, Oleg A. Prokopyev, Lisa M. Maillart:
Planning of life-depleting preventive maintenance activities with replacements. Ann. Oper. Res. 324(1): 1461-1483 (2023) - [j106]Haonan Zhong, Foad Mahdavi Pajouh, Oleg A. Prokopyev:
On designing networks resilient to clique blockers. Eur. J. Oper. Res. 307(1): 20-32 (2023) - [j105]Dmytro Matsypura, Alexander Veremyev, Eduardo L. Pasiliao, Oleg A. Prokopyev:
Finding the most degree-central walks and paths in a graph: Exact and heuristic approaches. Eur. J. Oper. Res. 308(3): 1021-1036 (2023) - [j104]Xueyu Shi, Oleg A. Prokopyev, Ted K. Ralphs:
Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds. Math. Program. Comput. 15(1): 1-51 (2023) - [j103]Jing Yang, Xueyu Shi, Oleg A. Prokopyev:
Exact solution approaches for a class of bilevel fractional programs. Optim. Lett. 17(1): 191-210 (2023) - [j102]Tomás Lagos, Oleg A. Prokopyev:
On complexity of finding strong-weak solutions in bilevel linear programming. Oper. Res. Lett. 51(6): 612-617 (2023) - [j101]Jourdain B. Lamperski, Oleg A. Prokopyev, Luca G. Wrabetz:
Min-Max-Min Optimization with Smooth and Strongly Convex Objectives. SIAM J. Optim. 33(3): 2435-2456 (2023) - [j100]Qingan Qiu, Lisa M. Maillart, Oleg A. Prokopyev, Lirong Cui:
Optimal Condition-Based Mission Abort Decisions. IEEE Trans. Reliab. 72(1): 408-425 (2023) - 2022
- [j99]Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao, Oleg A. Prokopyev:
On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs. Eur. J. Oper. Res. 297(1): 86-101 (2022) - [j98]Juan Sebastian Borrero, Oleg A. Prokopyev, Denis Sauré:
Learning in Sequential Bilevel Linear Programming. INFORMS J. Optim. 4(2): 174-199 (2022) - [j97]Shaoning Han, Andrés Gómez, Oleg A. Prokopyev:
Fractional 0-1 programming and submodularity. J. Glob. Optim. 84(1): 77-93 (2022) - [j96]Xueyu Shi, Oleg A. Prokopyev, Bo Zeng:
Sequence independent lifting for a set of submodular maximization problems. Math. Program. 196(1): 69-114 (2022) - [j95]Yehor Blokhin, Sergiy Butenko, Petar Momcilovic, Oleg A. Prokopyev:
On maximum ratio clique relaxations. Networks 80(4): 440-465 (2022) - 2021
- [j94]Gabriel L. Zenarosa, Oleg A. Prokopyev, Eduardo L. Pasiliao:
On exact solution approaches for bilevel quadratic 0-1 knapsack problem. Ann. Oper. Res. 298(1): 555-572 (2021) - [j93]Erfan Mehmanchi, Andrés Gómez, Oleg A. Prokopyev:
Solving a class of feature selection problems via fractional 0-1 programming. Ann. Oper. Res. 303(1): 265-295 (2021) - [j92]Sergey S. Ketkov, Oleg A. Prokopyev, Evgenii P. Burashnikov:
An approach to the distributionally robust shortest path problem. Comput. Oper. Res. 130: 105212 (2021) - [j91]Jing Yang, Juan Sebastian Borrero, Oleg A. Prokopyev, Denis Sauré:
Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback. Decis. Anal. 18(3): 218-244 (2021) - [j90]Erfan Mehmanchi, Hoda Bidkhori, Oleg A. Prokopyev:
Analysis of process flexibility designs under disruptions. IISE Trans. 53(2): 131-148 (2021) - [j89]Shadi Sanoubar, Lisa M. Maillart, Oleg A. Prokopyev:
Age-replacement policies under age-dependent replacement costs. IISE Trans. 53(4): 425-436 (2021) - [j88]Andrés Gómez, Oleg A. Prokopyev:
A Mixed-Integer Fractional Optimization Approach to Best Subset Selection. INFORMS J. Comput. 33(2): 551-565 (2021) - [j87]Colin P. Gillen, Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao:
Fortification Against Cascade Propagation Under Uncertainty. INFORMS J. Comput. 33(4): 1481-1499 (2021) - [j86]Pavlo A. Krokhmal, Oleg A. Prokopyev:
Optimization Letters Best Paper Award for 2019. Optim. Lett. 15(1): 1-2 (2021) - [j85]Shadi Sanoubar, Kai He, Lisa M. Maillart, Oleg A. Prokopyev:
Optimal Age-Replacement in Anticipation of Time-Dependent, Unpunctual Policy Implementation. IEEE Trans. Reliab. 70(3): 1177-1192 (2021) - [i3]Sergey S. Ketkov, Andrei S. Shilov, Oleg A. Prokopyev:
Data-Driven Combinatorial Optimization with Incomplete Information: a Distributionally Robust Optimization Approach. CoRR abs/2105.14139 (2021) - 2020
- [j84]M. Hosein Zare, Oleg A. Prokopyev, Denis Sauré:
On Bilevel Optimization with Inexact Follower. Decis. Anal. 17(1): 74-95 (2020) - [j83]Jongeun Kim, Alexander Veremyev, Vladimir Boginski, Oleg A. Prokopyev:
On the maximum small-world subgraph problem. Eur. J. Oper. Res. 280(3): 818-831 (2020) - [j82]Erfan Mehmanchi, Colin P. Gillen, Andrés Gómez, Oleg A. Prokopyev:
On Robust Fractional 0-1 Programming. INFORMS J. Optim. 2(2): 96-133 (2020) - [j81]Steffen Rebennack, Oleg A. Prokopyev, Bismark Singh:
Two-stage stochastic minimum s - t cut problems: Formulations, complexity and decomposition algorithms. Networks 75(3): 235-258 (2020) - [j80]Pavlo A. Krokhmal, Oleg A. Prokopyev:
Optimization Letters Best Paper Award for 2018. Optim. Lett. 14(1): 1 (2020) - [c4]Xueyu Shi, Oleg A. Prokopyev, Bo Zeng:
Sequence Independent Lifting for the Set of Submodular Maximization Problem. IPCO 2020: 378-390
2010 – 2019
- 2019
- [j79]M. Hosein Zare, Juan Sebastian Borrero, Bo Zeng, Oleg A. Prokopyev:
A note on linearized reformulations for a class of bilevel linear integer problems. Ann. Oper. Res. 272(1-2): 99-117 (2019) - [j78]Kai He, Lisa M. Maillart, Oleg A. Prokopyev:
Optimal sequencing of heterogeneous, non-instantaneous interventions. Ann. Oper. Res. 276(1-2): 109-135 (2019) - [j77]Dmytro Matsypura, Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao:
On exact solution approaches for the longest induced path problem. Eur. J. Oper. Res. 278(2): 546-562 (2019) - [j76]Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao:
Finding Critical Links for Closeness Centrality. INFORMS J. Comput. 31(2): 367-389 (2019) - [j75]Juan Sebastian Borrero, Oleg A. Prokopyev, Denis Sauré:
Sequential Interdiction with Incomplete Information and Learning. Oper. Res. 67(1): 72-89 (2019) - [j74]Onur Tavaslioglu, Oleg A. Prokopyev, Andrew J. Schaefer:
Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function. Oper. Res. 67(6): 1659-1677 (2019) - [j73]Erfan Mehmanchi, Andrés Gómez, Oleg A. Prokopyev:
Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations. J. Glob. Optim. 75(2): 273-339 (2019) - [j72]Xueyu Shi, Bo Zeng, Oleg A. Prokopyev:
On bilevel minimum and bottleneck spanning tree problems. Networks 74(3): 251-273 (2019) - [j71]Pavlo A. Krokhmal, Oleg A. Prokopyev:
Optimization Letters Best Paper Award for 2017. Optim. Lett. 13(1): 1 (2019) - [j70]Juan Sebastian Borrero, Oleg A. Prokopyev, Pavlo A. Krokhmal:
Optimization of Cascading Processes in Arbitrary Networks with Stochastic Interactions. IEEE Trans. Netw. Sci. Eng. 6(4): 773-787 (2019) - [i2]Sergey S. Ketkov, Oleg A. Prokopyev, Evgenii P. Burashnikov:
An approach to the distributionally robust shortest path problem. CoRR abs/1910.08744 (2019) - 2018
- [j69]Dmytro Matsypura, Oleg A. Prokopyev, Aizat Zahar:
Wildfire fuel management: Network-based models and optimization of prescribed burning. Eur. J. Oper. Res. 264(2): 774-796 (2018) - [j68]Osman Y. Özaltin, Oleg A. Prokopyev, Andrew J. Schaefer:
Optimal Design of the Seasonal Influenza Vaccine with Manufacturing Autonomy. INFORMS J. Comput. 30(2): 371-387 (2018) - [j67]M. Hosein Zare, Osman Y. Özaltin, Oleg A. Prokopyev:
On a class of bilevel linear mixed-integer programs in adversarial settings. J. Glob. Optim. 71(1): 91-113 (2018) - [j66]Anahita Khojandi, Lisa M. Maillart, Oleg A. Prokopyev, Mark S. Roberts, Samir F. Saba:
Dynamic Abandon/Extract Decisions for Failed Cardiac Leads. Manag. Sci. 64(2): 633-651 (2018) - [j65]Grigory Pastukhov, Alexander Veremyev, Vladimir Boginski, Oleg A. Prokopyev:
On maximum degree-based γ-quasi-clique problem: Complexity and exact approaches. Networks 71(2): 136-152 (2018) - [j64]Colin P. Gillen, Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao:
Critical arcs detection in influence networks. Networks 71(4): 412-431 (2018) - [j63]Pavlo A. Krokhmal, Oleg A. Prokopyev:
Optimization Letters Best Paper Award for 2016. Optim. Lett. 12(1): 1 (2018) - [r2]Oleg V. Shylo, Oleg A. Prokopyev:
Restart Strategies. Handbook of Heuristics 2018: 205-220 - [i1]Sergey S. Ketkov, Oleg A. Prokopyev:
On Greedy and Strategic Evaders in Sequential Interdiction Settings with Incomplete Information. CoRR abs/1810.05858 (2018) - 2017
- [j62]Vladimir Stozhkov, Vladimir Boginski, Oleg A. Prokopyev, Eduardo L. Pasiliao:
A simple greedy heuristic for linear assignment interdiction. Ann. Oper. Res. 249(1-2): 39-53 (2017) - [j61]Juan Sebastian Borrero, Colin P. Gillen, Oleg A. Prokopyev:
Fractional 0-1 programming: applications and algorithms. J. Glob. Optim. 69(1): 255-282 (2017) - [j60]Pavlo A. Krokhmal, Oleg A. Prokopyev:
Optimization Letters Best Paper Award for 2015. Optim. Lett. 11(1): 1-2 (2017) - [j59]Colin P. Gillen, Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao:
Robustness of solutions to critical node detection problems with imperfect data: a computational study. Optim. Methods Softw. 32(2): 250-273 (2017) - [j58]Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao:
Finding groups with maximum betweenness centrality. Optim. Methods Softw. 32(2): 369-399 (2017) - 2016
- [j57]Alexander Veremyev, Oleg A. Prokopyev, Sergiy Butenko, Eduardo L. Pasiliao:
Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs. Comput. Optim. Appl. 64(1): 177-214 (2016) - [j56]Behdad Beheshti, Oleg A. Prokopyev, Eduardo L. Pasiliao:
Exact solution approaches for bilevel assignment problems. Comput. Optim. Appl. 64(1): 215-242 (2016) - [j55]Juan Sebastian Borrero, Oleg A. Prokopyev, Denis Sauré:
Sequential Shortest Path Interdiction with Incomplete Information. Decis. Anal. 13(1): 68-98 (2016) - [j54]Sepehr Nemati, Oleg V. Shylo, Oleg A. Prokopyev, Andrew J. Schaefer:
The Surgical Patient Routing Problem: A Central Planner Approach. INFORMS J. Comput. 28(4): 657-673 (2016) - [j53]Serdar Karademir, Oleg A. Prokopyev, Robert J. Mailloux:
Irregular polyomino tiling via integer programming with application in phased array antenna design. J. Glob. Optim. 65(2): 137-173 (2016) - [j52]Sera Kahruman-Anderoglu, Austin Buchanan, Sergiy Butenko, Oleg A. Prokopyev:
On provably best construction heuristics for hard combinatorial optimization problems. Networks 67(3): 238-245 (2016) - [j51]Pavlo A. Krokhmal, Oleg A. Prokopyev:
Optimization Letters Best Paper Award. Optim. Lett. 10(1): 1 (2016) - [j50]Juan Sebastian Borrero, Colin P. Gillen, Oleg A. Prokopyev:
A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems. Oper. Res. Lett. 44(4): 479-486 (2016) - 2015
- [j49]Andrew C. Trapp, Oleg A. Prokopyev:
A note on constraint aggregation and value functions for two-stage stochastic integer programs. Discret. Optim. 15: 37-45 (2015) - [j48]Behdad Beheshti, Osman Y. Özaltin, M. Hosein Zare, Oleg A. Prokopyev:
Exact solution approach for a class of nonlinear bilevel knapsack problems. J. Glob. Optim. 61(2): 291-310 (2015) - [j47]Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao:
Critical nodes for distance-based connectivity and related problems in graphs. Networks 66(3): 170-195 (2015) - [j46]Serdar Karademir, Oleg A. Prokopyev:
On speed scaling via integer programming. Oper. Res. Lett. 43(5): 537-544 (2015) - [j45]Kai He, Lisa M. Maillart, Oleg A. Prokopyev:
Scheduling Preventive Maintenance as a Function of an Imperfect Inspection Interval. IEEE Trans. Reliab. 64(3): 983-997 (2015) - 2014
- [j44]Alexander Veremyev, Oleg A. Prokopyev, Vladimir Boginski, Eduardo L. Pasiliao:
Finding maximum subgraphs with relatively large vertex connectivity. Eur. J. Oper. Res. 239(2): 349-362 (2014) - [j43]Anahita Khojandi, Lisa M. Maillart, Oleg A. Prokopyev, Mark S. Roberts, Timothy Brown, William W. Barrington:
Optimal Implantable Cardioverter Defibrillator (ICD) Generator Replacement. INFORMS J. Comput. 26(3): 599-615 (2014) - [j42]Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao:
An integer programming framework for critical elements detection in graphs. J. Comb. Optim. 28(1): 233-273 (2014) - [j41]Oleg A. Prokopyev, Nikolaos V. Sahinidis:
Preface: Honoring the 60th birthday of Panos M. Pardalos. J. Glob. Optim. 59(2-3): 207 (2014) - [j40]Pavlo A. Krokhmal, Oleg A. Prokopyev:
Optimization Letters Best Paper Award. Optim. Lett. 8(8): 2153-2154 (2014) - [j39]Serdar Karademir, Nan Kong, Oleg A. Prokopyev:
On greedy approximation algorithms for a class of two-stage stochastic assignment problems. Optim. Methods Softw. 29(1): 42-67 (2014) - [j38]Guvenc Degirmenci, Jeffrey P. Kharoufeh, Oleg A. Prokopyev:
Maximizing the Lifetime of Query-Based Wireless Sensor Networks. ACM Trans. Sens. Networks 10(4): 56:1-56:24 (2014) - 2013
- [j37]Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Oleg A. Prokopyev:
On characterization of maximal independent sets via quadratic optimization. J. Heuristics 19(4): 629-644 (2013) - [j36]Oleksii Mostovyi, Oleg A. Prokopyev, Oleg V. Shylo:
On Maximum Speedup Ratio of Restart Algorithm Portfolios. INFORMS J. Comput. 25(2): 222-229 (2013) - [j35]Oleg V. Shylo, Oleg A. Prokopyev, Andrew J. Schaefer:
Stochastic Operating Room Scheduling for High-Volume Specialties Under Block Booking. INFORMS J. Comput. 25(4): 682-692 (2013) - [j34]Andrew C. Trapp, Oleg A. Prokopyev, Andrew J. Schaefer:
On a Level-Set Characterization of the Value Function of an Integer Program and Its Application to Stochastic Programming. Oper. Res. 61(2): 498-511 (2013) - [j33]Oleksii Ursulenko, Sergiy Butenko, Oleg A. Prokopyev:
A global optimization algorithm for solving the minimum multiple ratio spanning tree problem. J. Glob. Optim. 56(3): 1029-1043 (2013) - [j32]Pavlo A. Krokhmal, Oleg A. Prokopyev:
Editorial. Optim. Lett. 7(1): 1-2 (2013) - 2012
- [j31]Osman Y. Özaltin, Oleg A. Prokopyev, Andrew J. Schaefer:
Two-stage quadratic integer programs with stochastic right-hand sides. Math. Program. 133(1-2): 121-158 (2012) - 2011
- [j30]Mustafa Baz, Brady Hunsaker, Oleg A. Prokopyev:
How much do we "pay" for using default parameters? Comput. Optim. Appl. 48(1): 91-108 (2011) - [j29]Jayant Rajgopal, Zhouyan Wang, Andrew J. Schaefer, Oleg A. Prokopyev:
Integrated design and operation of remnant inventory supply chains under uncertainty. Eur. J. Oper. Res. 214(2): 358-364 (2011) - [j28]Osman Y. Özaltin, Oleg A. Prokopyev, Andrew J. Schaefer, Mark S. Roberts:
Optimizing the Societal Benefits of the Annual Influenza Vaccine: A Stochastic Programming Approach. Oper. Res. 59(5): 1131-1143 (2011) - [j27]Oleg V. Shylo, Oleg A. Prokopyev, Jayant Rajgopal:
On algorithm portfolios and restart strategies. Oper. Res. Lett. 39(1): 49-52 (2011) - [c3]Oleg V. Shylo, K. Louis Luangkesorn, Oleg A. Prokopyev, Jayant Rajgopal, Andrew J. Schaefer:
Managing patient backlog in a surgical suite that uses a block-booking scheduling system. WSC 2011: 1319-1329 - 2010
- [j26]N. A. Temiz, Andrew C. Trapp, Oleg A. Prokopyev, Carlos J. Camacho:
Optimization of minimum set of protein-DNA interactions: a quasi exact solution with minimum over-fitting. Bioinform. 26(3): 319-325 (2010) - [j25]Andrew C. Trapp, Oleg A. Prokopyev:
Solving the Order-Preserving Submatrix Problem via Integer Programming. INFORMS J. Comput. 22(3): 387-400 (2010) - [j24]Andrew C. Trapp, Oleg A. Prokopyev, Stanislav Busygin:
Finding checkerboard patterns via fractional 0-1 programming. J. Comb. Optim. 20(1): 1-26 (2010) - [j23]Osman Y. Özaltin, Oleg A. Prokopyev, Andrew J. Schaefer:
The bilevel knapsack problem with stochastic right-hand sides. Oper. Res. Lett. 38(4): 328-333 (2010)
2000 – 2009
- 2009
- [j22]Oleg A. Prokopyev:
On equivalent reformulations for absolute value equations. Comput. Optim. Appl. 44(3): 363-372 (2009) - [j21]Oleg A. Prokopyev, Nan Kong, Dayna L. Martinez-Torres:
The equitable dispersion problem. Eur. J. Oper. Res. 197(1): 59-67 (2009) - [j20]Oleg A. Prokopyev, Sergiy Butenko, Andrew C. Trapp:
Checking solvability of systems of interval linear equations and inequalities via mixed integer programming. Eur. J. Oper. Res. 199(1): 117-121 (2009) - [j19]Onur Seref, O. Erhun Kundakcioglu, Oleg A. Prokopyev, Panos M. Pardalos:
Selective support vector machines. J. Comb. Optim. 17(1): 3-20 (2009) - [c2]Prasanna Velagapudi, Oleg A. Prokopyev, Katia P. Sycara, Paul Scerri:
Analyzing the performance of randomized information sharing. AAMAS (2) 2009: 821-828 - [r1]Oleg A. Prokopyev:
Fractional Zero-One Programming. Encyclopedia of Optimization 2009: 1091-1094 - 2008
- [j18]Stanislav Busygin, Oleg A. Prokopyev, Panos M. Pardalos:
Biclustering in data mining. Comput. Oper. Res. 35(9): 2964-2987 (2008) - [j17]Panos M. Pardalos, Oleg A. Prokopyev, Oleg V. Shylo, Vladimir Shylo:
Global equilibrium search applied to the unconstrained binary quadratic optimization problem. Optim. Methods Softw. 23(1): 129-140 (2008) - [j16]Oleg V. Shylo, Oleg A. Prokopyev, Vladimir Shylo:
Solving weighted MAX-SAT via global equilibrium search. Oper. Res. Lett. 36(4): 434-438 (2008) - [p1]Carlos A. S. Oliveira, Panos M. Pardalos, Oleg A. Prokopyev:
Data Structures and Algorithms. Wiley Encyclopedia of Computer Science and Engineering 2008 - 2007
- [j15]Carlos A. S. Oliveira, Panos M. Pardalos, Oleg A. Prokopyev, Mauricio G. C. Resende:
Streaming cache placement problems: complexity and algorithms. Int. J. Comput. Sci. Eng. 3(3): 173-183 (2007) - [j14]Athanasia Karakitsiou, Oleg A. Prokopyev:
Preface. J. Glob. Optim. 38(4): 507 (2007) - [j13]Christodoulos A. Floudas, Oleg A. Prokopyev:
Preface. Optim. Methods Softw. 22(1): 1 (2007) - [j12]Stanislav Busygin, Oleg A. Prokopyev, Panos M. Pardalos:
An optimization-based approach for data classification. Optim. Methods Softw. 22(1): 3-9 (2007) - [c1]Prasanna Velagapudi, Oleg A. Prokopyev, Katia P. Sycara, Paul Scerri:
Maintaining shared belief in a large multiagent team. FUSION 2007: 1-8 - 2006
- [j11]Wanpracha Art Chaovalitwongse, Oleg A. Prokopyev, Panos M. Pardalos:
Electroencephalogram (EEG) time series classification: Applications in epilepsy. Ann. Oper. Res. 148(1): 227-250 (2006) - [j10]Hong-Xuan Huang, Panos M. Pardalos, Oleg A. Prokopyev:
Lower Bound Improvement and Forcing Rule for Quadratic Binary Programming. Comput. Optim. Appl. 33(2-3): 187-208 (2006) - [j9]Manki Min, Oleg A. Prokopyev, Panos M. Pardalos:
Optimal solutions to minimum total energy broadcasting problem in wireless ad hoc networks. J. Comb. Optim. 11(1): 59-69 (2006) - [j8]Oleg A. Prokopyev:
Book review. Optim. Methods Softw. 21(6): 995-996 (2006) - 2005
- [j7]Stanislav Busygin, Oleg A. Prokopyev, Panos M. Pardalos:
Feature Selection for Consistent Biclustering via Fractional 0-1 Programming. J. Comb. Optim. 10(1): 7-21 (2005) - [j6]Ho Ki Fung, S. Rao, Christodoulos A. Floudas, Oleg A. Prokopyev, Panos M. Pardalos, Franz Rendl:
Computational Comparison Studies of Quadratic Assignment Like Formulations for the In Silico Sequence Selection Problem in De Novo Protein Design. J. Comb. Optim. 10(1): 41-60 (2005) - [j5]Oleg A. Prokopyev, Hong-Xuan Huang, Panos M. Pardalos:
On complexity of unconstrained hyperbolic 0-1 programming problems. Oper. Res. Lett. 33(3): 312-318 (2005) - 2004
- [j4]Oleg A. Prokopyev, Panos M. Pardalos:
On Approximability of Boolean Formula Minimization. J. Comb. Optim. 8(2): 129-135 (2004) - [j3]Oleg A. Prokopyev, Panos M. Pardalos:
Minimum elsilon-equivalent Circuit Size Problem. J. Comb. Optim. 8(4): 495-502 (2004) - [j2]Panos M. Pardalos, Wanpracha Art Chaovalitwongse, Leonidas D. Iasemidis, J. Chris Sackellares, Deng-Shan Shiau, Paul R. Carney, Oleg A. Prokopyev, Vitaliy A. Yatsenko:
Seizure warning algorithm based on optimization and nonlinear dynamics. Math. Program. 101(2): 365-385 (2004) - [j1]Wanpracha Art Chaovalitwongse, Panos M. Pardalos, Oleg A. Prokopyev:
A new linearization technique for multi-quadratic 0-1 programming problems. Oper. Res. Lett. 32(6): 517-522 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 20:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint