The following pages link to Oleg A. Prokopyev (Q276862):
Displayed 50 items.
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- Exact solution approaches for bilevel assignment problems (Q276866) (← links)
- Irregular polyomino tiling via integer programming with application in phased array antenna design (Q288219) (← links)
- Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
- An integer programming framework for critical elements detection in graphs (Q405684) (← links)
- Two-stage quadratic integer programs with stochastic right-hand sides (Q431020) (← links)
- A simple greedy heuristic for linear assignment interdiction (Q513608) (← links)
- Finding checkerboard patterns via fractional 0-1 programming (Q604870) (← links)
- (Q626649) (redirect page) (← links)
- How much do we ``pay'' for using default parameters? (Q626650) (← links)
- On algorithm portfolios and restart strategies (Q631216) (← links)
- A new linearization technique for multi-quadratic 0-1 programming problems. (Q703274) (← links)
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem (Q829202) (← links)
- Optimal solutions to minimum total energy broadcasting problem in wireless ad hoc networks (Q857761) (← links)
- Electroencephalogram (EEG) time series classification: applications in epilepsy (Q863612) (← links)
- The bilevel knapsack problem with stochastic right-hand sides (Q991476) (← links)
- Solving weighted MAX-SAT via global equilibrium search (Q1003491) (← links)
- The equitable dispersion problem (Q1011261) (← links)
- Checking solvability of systems of interval linear equations and inequalities via mixed integer programming (Q1042106) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- Wildfire fuel management: network-based models and optimization of prescribed burning (Q1681542) (← links)
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems (Q1694780) (← links)
- A note on linearized reformulations for a class of bilevel linear integer problems (Q1730617) (← links)
- On a class of bilevel linear mixed-integer programs in adversarial settings (Q1754450) (← links)
- Seizure warning algorithm based on optimization and nonlinear dynamics (Q1764235) (← links)
- On approximability of Boolean formula minimization (Q1768604) (← links)
- Minimum \(\varepsilon\)-equivalent circuit size problem (Q1777423) (← links)
- On complexity of unconstrained hyperbolic 0--1 programming problems (Q1779713) (← links)
- On speed scaling via integer programming (Q1785426) (← links)
- On exact solution approaches for the longest induced path problem (Q1999389) (← links)
- Sequence independent lifting for a set of submodular maximization problems (Q2097631) (← links)
- Fractional 0-1 programming and submodularity (Q2162513) (← links)
- Solving a class of feature selection problems via fractional 0--1 programming (Q2241181) (← links)
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
- Selective support vector machines (Q2271140) (← links)
- Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations (Q2274883) (← links)
- Integrated design and operation of remnant inventory supply chains under uncertainty (Q2275828) (← links)
- On the maximum small-world subgraph problem (Q2327623) (← links)
- Optimal sequencing of heterogeneous, non-instantaneous interventions (Q2329892) (← links)
- A note on constraint aggregation and value functions for two-stage stochastic integer programs (Q2339848) (← links)
- On characterization of maximal independent sets via quadratic optimization (Q2359154) (← links)
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem (Q2392120) (← links)
- Biclustering in data mining (Q2475854) (← links)
- Lower bound improvement and forcing rule for quadratic binary programming (Q2506180) (← links)
- Feature selection for consistent biclustering via fractional 0-1 programming (Q2576438) (← links)
- On equivalent reformulations for absolute value equations (Q2655401) (← links)
- An approach to the distributionally robust shortest path problem (Q2668652) (← links)
- Exact solution approaches for a class of bilevel fractional programs (Q2679008) (← links)
- Optimizing the Societal Benefits of the Annual Influenza Vaccine: A Stochastic Programming Approach (Q2879508) (← links)
- Solving the Order-Preserving Submatrix Problem via Integer Programming (Q2899070) (← links)