activity
20142026
most citedStrong SOCP Relaxations for the Optimal Power Flow Problem

285 citations · 797 across the 32 of their papers we have counts for

collaborators
Showing 2025Show all

8 papers · 1 filter

cs.CG2025

Solving the Heilbronn Triangle Problem using Global Optimization Methods

Amirhossein Monji, Amirali Modir, Burak Kocuk

We study the Heilbronn triangle problem, which involves placing n points in the unit square such that the minimum area of any triangle formed by these points is maximized. A straig…

math.OC2025

Convexification of a Separable Function over a Polyhedral Ground Set

Santanu S. Dey, Burak Kocuk

In this paper, we study the set , where and the ground set is a nonempty…

math.OC2025

A Stochastic Programming Approach to the Railcar Maintenance Problem with Service Level and Track Capacity Considerations

Murat Elhüseyni, Burak Kocuk

Railcars, as part of the rolling stock, perform regular transportation tasks with respect to a service level agreement (SLA) and undergo preventive maintenance at regular intervals…

math.OC2025

A Dynamic Strategic Plan for Transition to Campus-Scale Clean Electricity Using Multi-Stage Stochastic Programming

Ahmet Emir Şener, Burak Kocuk, Tuğçe Yüksel

The decarbonization of energy systems at energy-intensive sites is an essential component of global climate mitigation, yet such transitions involve substantial capital requirement…

math.OC2025

Global Optimization of Gas Transportation and Storage: Convex Hull Characterizations and Relaxations

Bahar Cennet Okumusoglu, Burak Kocuk

Gas transportation and storage has become one of the most relevant and important optimization problems in energy systems. This problem inherently includes highly nonlinear and nonc…

math.OC2025

Risk-Averse Antibiotics Time Machine Problem

Deniz Tuncer, Burak Kocuk

Antibiotic resistance, which is a serious healthcare issue, emerges due to uncontrolled and repeated antibiotic use that causes bacteria to mutate and develop resistance to antibio…

math.OC2025

Learning to Relax Nonconvex Quadratically Constrained Quadratic Programs

Muge Dedeoglu, Buket Ozen, Burak Kocuk

Quadratically constrained quadratic programs (QCQPs) are ubiquitous in optimization: Such problems arise in applications from operations research, power systems, signal processing,…

math.OC2025

On the integrality gap of convex mixed-integer programs

Burak Kocuk, Diego Moran Ramirez

We study the integrality gap of convex mixed-integer programs, that is, the difference between the optimal value of such a problem and the optimal value of its continuous relaxatio…