Alper Atamtürk

According to our database1, Alper Atamtürk authored at least 59 papers between 1996 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Penalized semidefinite programming for quadratically-constrained quadratic optimization.
J. Glob. Optim., 2020

Submodularity in Conic Quadratic Mixed 0-1 Optimization.
Oper. Res., 2020

Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction.
INFORMS J. Comput., 2020

Safe Screening Rules for 𝓁<sub>0</sub>-Regression.
CoRR, 2020

2019
Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra.
Math. Program. Comput., 2019

Lifted polymatroid inequalities for mean-risk optimization with indicator variables.
J. Glob. Optim., 2019

Submodular Function Minimization and Polarity.
CoRR, 2019

Rank-one Convexification for Sparse Regression.
CoRR, 2019

2018
A note on capacity models for network design.
Oper. Res. Lett., 2018

Network design with probabilistic capacities.
Networks, 2018

Strong formulations for quadratic optimization with M-matrices and indicator variables.
Math. Program., 2018

Technical Note - A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model.
Oper. Res., 2018

Sparse and Smooth Signal Estimation: Convexification of L0 Formulations.
CoRR, 2018

2017
Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem.
SIAM J. Optim., 2017

A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables.
Math. Program., 2017

Maximizing a Class of Utility Functions Over the Vertices of a Polytope.
Oper. Res., 2017

Editorial.
Discret. Optim., 2017

Power System State Estimation and Bad Data Detection by Means of Conic Relaxation.
Proceedings of the 50th Hawaii International Conference on System Sciences, 2017

Promises of conic relaxations in optimal transmission switching of power systems.
Proceedings of the 56th IEEE Annual Conference on Decision and Control, 2017

2016
Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems.
Networks, 2016

A polyhedral study of production ramping.
Math. Program., 2016

A strong semidefinite programming relaxation of the unit commitment problem.
Proceedings of the 55th IEEE Conference on Decision and Control, 2016

2015
Supermodular covering knapsack polytope.
Discret. Optim., 2015

2014
Aircraft Rescheduling with Cruise Speed Control.
Oper. Res., 2014

Exact reachability analysis for planning skew-line needle arrangements for automated brachytherapy.
Proceedings of the 2014 IEEE International Conference on Automation Science and Engineering, 2014

2013
Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds.
INFORMS J. Comput., 2013

2012
n-step mingling inequalities: new facets for the mixed-integer knapsack set.
Math. Program., 2012

A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems.
Oper. Res., 2012

2011
Lifting for conic mixed-integer programming.
Math. Program., 2011

Maximizing a class of submodular utility functions.
Math. Program., 2011

2010
Parallel machine match-up scheduling with manufacturing cost considerations.
J. Sched., 2010

Conic mixed-integer rounding cuts.
Math. Program., 2010

Mingling: mixed-integer rounding with bounds.
Math. Program., 2010

2009
A strong conic quadratic reformulation for machine-job assignment with controllable processing times.
Oper. Res. Lett., 2009

The submodular knapsack polytope.
Discret. Optim., 2009

2008
Polymatroids and mean-risk minimization in discrete optimization.
Oper. Res. Lett., 2008

An O(n<sup>2</sup>) algorithm for lot sizing with inventory bounds and fixed costs.
Oper. Res. Lett., 2008

The Flow Set with Partial Order.
Math. Oper. Res., 2008

Partition inequalities for capacitated survivable network design based on directed p-cycles.
Discret. Optim., 2008

2007
Network design arc set with variable upper bounds.
Networks, 2007

Two-Stage Robust Network Flow and Design Under Demand Uncertainty.
Oper. Res., 2007

Cuts for Conic Mixed-Integer Programming.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006
Strong Formulations of Robust Mixed 0-1 Programming.
Math. Program., 2006

2005
Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation.
Oper. Res., 2005

Integer-Programming Software Systems.
Ann. Oper. Res., 2005

Cover and Pack Inequalities for (Mixed) Integer Programming.
Ann. Oper. Res., 2005

2004
A directed cycle-based column-and-cut generation method for capacitated survivable network design.
Networks, 2004

A study of the lot-sizing polytope.
Math. Program., 2004

Sequence Independent Lifting for Mixed-Integer Programming.
Oper. Res., 2004

2003
On the facets of the mixed-integer knapsack polyhedron.
Math. Program., 2003

2002
On splittable and unsplittable flow capacitated network design arc-set polyhedra.
Math. Program., 2002

On capacitated network design cut-set polyhedra.
Math. Program., 2002

2001
Flow pack facets of the single node fixed-charge flow polytope.
Oper. Res. Lett., 2001

Valid inequalities for problems with additive variable upper bounds.
Math. Program., 2001

Capacity Acquisition, Subcontracting, and Lot Sizing.
Manag. Sci., 2001

2000
The mixed vertex packing problem.
Math. Program., 2000

A Relational Modeling System for Linear and Integer Programming.
Oper. Res., 2000

Conflict graphs in solving integer programming problems.
Eur. J. Oper. Res., 2000

1996
A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems.
J. Heuristics, 1996


  Loading...