Gnlk Oktay

Oktay Gnlk

Information about the author Oktay Gnlk will soon be added to the site.
Found 11 papers in total
Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
2017
With stochastic integer programming as the motivating application, we investigate...
On mixed‐integer sets with two integer variables
On mixed‐integer sets with two integer variables
2011
We study polyhedral mixed‐integer sets with two integer variables. We show that...
A note on the MIR closure and basic relaxations of polyhedra
A note on the MIR closure and basic relaxations of polyhedra
2011
Anderson et al. (2005) show that for a polyhedral mixed integer set defined by a...
A pricing problem under Monge property
A pricing problem under Monge property
2008
We study a pricing problem where buyers with non-uniform demand purchase one of many...
A branch-and-price algorithm and new test problems for spectrum auctions
A branch-and-price algorithm and new test problems for spectrum auctions
2005
When combinatorial bidding is permitted in auctions, such as the proposed FCC Auction...
Robust capacity planning in semiconductor manufacturing
Robust capacity planning in semiconductor manufacturing
2005
We present a stochastic programming approach to capacity planning under demand...
Reformulating linear programs with transportation constraints – with applications to workforce scheduling
Reformulating linear programs with transportation constraints – with applications to workforce scheduling
2004
We study linear programming models that contain transportation constraints in their...
An integer programming model for the weekly tour scheduling problem
An integer programming model for the weekly tour scheduling problem
2001
We study a workforce planning and scheduling problem in which weekly tours of agents...
Minimum cost capacity installation for multicommodity network flows
Minimum cost capacity installation for multicommodity network flows
1998
Consider a directed graph G = ( V,A ), and a set of traffic demands to be shipped...
Capacitated network design—polyhedral structure and computation
Capacitated network design—polyhedral structure and computation
1996
We study a capacity expansion problem that arises in telecommunication network design....
Capacitated network design-Polyhedral structure and computation
Capacitated network design-Polyhedral structure and computation
1996
The authors study a capacity expansion problem that arises in telecommunication...
Papers per page: