Alper Atamtürk

CoRR, 2024

2023

On the softplus penalty for large-scale convex optimization.

[BibT_eX]

[DOI]

Meng Li

Paul Grigas

Oper. Res. Lett., November, 2023

$\mathbf {2\times 2}$-Convexifications for convex quadratic optimization with indicator variables.

[BibT_eX]

[DOI]

Shaoning Han

Math. Program., November, 2023

Supermodularity and valid inequalities for quadratic optimization with indicators.

[BibT_eX]

[DOI]

Math. Program., 2023

2022

The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables.

[BibT_eX]

[DOI]

Shaoning Han

Oper. Res. Lett., 2022

Submodular function minimization and polarity.

[BibT_eX]

[DOI]

Math. Program., 2022

State-driven Implicit Modeling for Sparsity and Robustness in Neural Networks.

[BibT_eX]

[DOI]

CoRR, 2022

Parabolic Relaxation for Quadratically-constrained Quadratic Programming - Part II: Theoretical & Computational Results.

[BibT_eX]

[DOI]

Ramtin Madani

Mersedeh Ashraphijuo

Mohsen Kheirandishfard

CoRR, 2022

Parabolic Relaxation for Quadratically-constrained Quadratic Programming - Part I: Definitions & Basic Properties.

[BibT_eX]

[DOI]

Ramtin Madani

Mersedeh Ashraphijuo

Mohsen Kheirandishfard

CoRR, 2022

Safe Screening for Logistic Regression with 𝓁0-𝓁2 Regularization.

[BibT_eX]

[DOI]

Anna Deza

CoRR, 2022

Safe Screening for Logistic Regression with ℓ -ℓ Regularization.

[BibT_eX]

[DOI]

Anna Deza

Proceedings of the 14th International Joint Conference on Knowledge Discovery, 2022

2021

Sparse and Smooth Signal Estimation: Convexification of L0-Formulations.

[BibT_eX]

[DOI]

Shaoning Han

J. Mach. Learn. Res., 2021

Enhanced Modeling of Contingency Response in Security-constrained Optimal Power Flow.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Penalized semidefinite programming for quadratically-constrained quadratic optimization.

[BibT_eX]

[DOI]

Ramtin Madani

Mohsen Kheirandishfard

Javad Lavaei

J. Glob. Optim., 2020

Submodularity in Conic Quadratic Mixed 0-1 Optimization.

[BibT_eX]

[DOI]

Oper. Res., 2020

Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction.

[BibT_eX]

[DOI]

Carlos Deck

Hyemin Jeon

INFORMS J. Comput., 2020

Safe Screening Rules for 𝓁0-Regression.

[BibT_eX]

[DOI]

CoRR, 2020

Safe screening rules for L0-regression from Perspective Relaxations.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

2019

Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra.

[BibT_eX]

[DOI]

Math. Program. Comput., 2019

Lifted polymatroid inequalities for mean-risk optimization with indicator variables.

[BibT_eX]

[DOI]

Hyemin Jeon

J. Glob. Optim., 2019

Rank-one Convexification for Sparse Regression.

[BibT_eX]

[DOI]

CoRR, 2019

2018

A note on capacity models for network design.

[BibT_eX]

[DOI]

Oktay Günlük

Oper. Res. Lett., 2018

Network design with probabilistic capacities.

[BibT_eX]

[DOI]

Avinash Bhardwaj

Networks, 2018

Strong formulations for quadratic optimization with M-matrices and indicator variables.

[BibT_eX]

[DOI]

Math. Program., 2018

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

[BibT_eX]

[DOI]

Alper Sen

Philip M. Kaminsky

Oper. Res., 2018

2017

Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem.

[BibT_eX]

[DOI]

Birce Tezel

SIAM J. Optim., 2017

A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables.

[BibT_eX]

[DOI]

Chen Chen

Shmuel S. Oren

Math. Program., 2017

Maximizing a Class of Utility Functions Over the Vertices of a Polytope.

[BibT_eX]

[DOI]

Oper. Res., 2017

Editorial.

[BibT_eX]

[DOI]

Sam Burer

Discret. Optim., 2017

Power System State Estimation and Bad Data Detection by Means of Conic Relaxation.

[BibT_eX]

[DOI]

Proceedings of the 50th Hawaii International Conference on System Sciences, 2017

Promises of conic relaxations in optimal transmission switching of power systems.

[BibT_eX]

[DOI]

Salar Fattahi

Javad Lavaei

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.

[BibT_eX]

[DOI]

Networks, 2016

A polyhedral study of production ramping.

[BibT_eX]

[DOI]

Math. Program., 2016

A strong semidefinite programming relaxation of the unit commitment problem.

[BibT_eX]

[DOI]

Proceedings of the 55th IEEE Conference on Decision and Control, 2016

2015

Supermodular covering knapsack polytope.

[BibT_eX]

[DOI]

Avinash Bhardwaj

Discret. Optim., 2015

2014

Aircraft Rescheduling with Cruise Speed Control.

[BibT_eX]

[DOI]

M. Selim Aktürk

Sinan Gürel

Oper. Res., 2014

Exact reachability analysis for planning skew-line needle arrangements for automated brachytherapy.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Laurent Flindt Muller

David Pisinger

INFORMS J. Comput., 2013

2012

n-step mingling inequalities: new facets for the mixed-integer knapsack set.

[BibT_eX]

[DOI]

Kiavash Kianfar

Math. Program., 2012

A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems.

[BibT_eX]

[DOI]

Gemma Berenguer

Zuo-Jun Max Shen

Oper. Res., 2012

2011

Lifting for conic mixed-integer programming.

[BibT_eX]

[DOI]

Math. Program., 2011

Maximizing a class of submodular utility functions.

[BibT_eX]

[DOI]

Shabbir Ahmed

Math. Program., 2011

2010

Parallel machine match-up scheduling with manufacturing cost considerations.

[BibT_eX]

[DOI]

M. Selim Aktürk

Sinan Gürel

J. Sched., 2010

Conic mixed-integer rounding cuts.

[BibT_eX]

[DOI]

Math. Program., 2010

Mingling: mixed-integer rounding with bounds.

[BibT_eX]

[DOI]

Oktay Günlük

Math. Program., 2010

2009

A strong conic quadratic reformulation for machine-job assignment with controllable processing times.

[BibT_eX]

[DOI]

M. Selim Akturk

Sinan Gurel

Oper. Res. Lett., 2009

The submodular knapsack polytope.

[BibT_eX]

[DOI]

Discret. Optim., 2009

2008

Polymatroids and mean-risk minimization in discrete optimization.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

An O(n2) algorithm for lot sizing with inventory bounds and fixed costs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

The Flow Set with Partial Order.

[BibT_eX]

[DOI]

Muhong Zhang

Math. Oper. Res., 2008

Partition inequalities for capacitated survivable network design based on directed p-cycles.

[BibT_eX]

[DOI]

Deepak Rajan

Discret. Optim., 2008

2007

Network design arc set with variable upper bounds.

[BibT_eX]

[DOI]

Oktay Günlük

Networks, 2007

Two-Stage Robust Network Flow and Design Under Demand Uncertainty.

[BibT_eX]

[DOI]

Muhong Zhang

Oper. Res., 2007

Cuts for Conic Mixed-Integer Programming.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006

Strong Formulations of Robust Mixed 0-1 Programming.

[BibT_eX]

[DOI]

Math. Program., 2006

2005

Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation.

[BibT_eX]

[DOI]

Oper. Res., 2005

Integer-Programming Software Systems.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2005

Cover and Pack Inequalities for (Mixed) Integer Programming.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2005

2004

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

[BibT_eX]

[DOI]

Deepak Rajan

Networks, 2004

A study of the lot-sizing polytope.

[BibT_eX]

[DOI]

Juan Carlos Muñoz

Math. Program., 2004

Sequence Independent Lifting for Mixed-Integer Programming.

[BibT_eX]

[DOI]

Oper. Res., 2004

2003

On the facets of the mixed-integer knapsack polyhedron.

[BibT_eX]

[DOI]

Math. Program., 2003

2002

On splittable and unsplittable flow capacitated network design arc-set polyhedra.

[BibT_eX]

[DOI]

Deepak Rajan

Math. Program., 2002

On capacitated network design cut-set polyhedra.

[BibT_eX]

[DOI]

Math. Program., 2002

2001

Flow pack facets of the single node fixed-charge flow polytope.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2001

Valid inequalities for problems with additive variable upper bounds.

[BibT_eX]

[DOI]

Math. Program., 2001

Capacity Acquisition, Subcontracting, and Lot Sizing.

[BibT_eX]

[DOI]

Dorit S. Hochbaum

Manag. Sci., 2001

2000

The mixed vertex packing problem.

[BibT_eX]

[DOI]

Math. Program., 2000

A Relational Modeling System for Linear and Integer Programming.

[BibT_eX]

[DOI]

Ellis L. Johnson

Jeff T. Linderoth

Oper. Res., 2000

Conflict graphs in solving integer programming problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2000

1996

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

[BibT_eX]

[DOI]