Fetching the paper…
Reading the bibliography…
We describe strong convex valid inequalities for conic quadratic mixed 0-1 optimization.
A linear programming approach to the cutting stock problem—part ii
Gilmore, P. C. and Gomory, R. E. (1963) · 1963
Earlier work this paper cites.
Submodular functions, matroids, and certain polyhedra
Edmonds, J. (1970) · 1970
Earlier work this paper cites.
The ellipsoid method and its consequences in combinatorial optimization
Grötschel, M., Lovász, L., and Schrijver, A. (1981) · 1981
Earlier work this paper cites.
Submodular functions and convexity
Lovász, L. (1983) · 1982
Earlier work this paper cites.
Minlp model for cyclic multiproduct scheduling on continuous parallel lines
Sahinidis, N. and Grossmann, I. E. (1991) · 1991
Earlier work this paper cites.
Deterministic network interdiction
Wood, R. K. (1993) · 1993
Earlier work this paper cites.
The Sharpe ratio
Sharpe, W. F. (1994) · 1994
Earlier work this paper cites.
Convex relaxations of (0, 1)-quadratic programming
Poljak, S. and Wolkowicz, H. (1995) · 1995
Earlier work this paper cites.
Solution procedures for the service system design problem
Amiri, A. (1997) · 1997
Earlier work this paper cites.
Robust convex optimization
Ben-Tal, A. and Nemirovski, A. (1998) · 1998
Earlier work this paper cites.
Stochastic network interdiction
Cormican, K. J., Morton, D. P., and Wood, R. K. (1998) · 1998
Earlier work this paper cites.
Robust solutions of uncertain linear programs
Ben-Tal, A. and Nemirovski, A. (1999) · 1999
Earlier work this paper cites.
Single-stage resource allocation and economic lot scheduling on multiple, nonidentical production lines
Bollapragada, R. and Rao, U. (1999) · 1999
Earlier work this paper cites.
Convex programming for disjunctive convex optimization
Ceria, S. and Soares, J. (1999) · 1999
Earlier work this paper cites.
A branch-and-cut method for 0-1 mixed convex programming
Stubbs, A. R. and Mehrotra, S. (1999) · 1999
Earlier work this paper cites.
A combinatorial algorithm minimizing submodular functions in strongly polynomial time
Schrijver, A. (2000) · 2000
Earlier work this paper cites.
On polyhedral approximations of the second-order cone
Ben-Tal, A. and Nemirovski, A. (2001) · 2001
Earlier work this paper cites.
11 facility location problems with stochastic demands and congestion
Berman, O. and Krass, D. (2001) · 2001
Earlier work this paper cites.
Production and Operations Analysis
Nahmias, S. (2001) · 2001
Earlier work this paper cites.
Shortest-path network interdiction
Israeli, E. and Wood, R. K. (2002) · 2002
Earlier work this paper cites.
Global optimization of 0-1 hyperbolic programs
Tawarmalani, M., Ahmed, S., and Sahinidis, N. V. (2002) · 2002
Earlier work this paper cites.
Robust discrete optimization and network flows
Bertsimas, D. and Sim, M. (2003) · 2003
Earlier work this paper cites.
Elementary Number Theory, Group Theory and Ramanujan Graphs
Davidoff, G., Sarnak, P., and Valette, A. (2003) · 2003
Earlier work this paper cites.
Worst-case value-at-risk and robust portfolio optimization: A conic programming approach
El Ghaoui, L., Oks, M., and Oustry, F. (2003) · 2003
Earlier work this paper cites.
Economic lot scheduling on multiple production lines with resource constraints
Pesenti, R. and Ukovich, W. (2003) · 2003
Earlier work this paper cites.
A joint location-inventory model
Shen, Z.-J. M., Coullard, C., and Daskin, M. S. (2003) · 2003
Earlier work this paper cites.
The price of robustness
Bertsimas, D. and Sim, M. (2004) · 2004
Earlier work this paper cites.
Simultaneous design and scheduling of multipurpose plants using resource task network based continuous-time formulations
Castro, P. M., Barbosa-Póvoa, A. P., and Novais, A. Q. (2005) · 2005
Cited alongside, same era.
Cuts for mixed 0-1 conic programming
Çezik, M. T. and Iyengar, G. (2005) · 2005
Cited alongside, same era.
Exact solution of a class of nonlinear knapsack problems
Elhedhli, S. (2005) · 2005
Cited alongside, same era.
Submodular Functions and Optimization
Fujishige, S. (2005) · 2005
Cited alongside, same era.
On multiple-ratio hyperbolic 0–1 programming problems
Prokopyev, O. A., Meneses, C., Oliveira, C. A., and Pardalos, P. M. (2005) · 2005
Cited alongside, same era.
A polyhedral branch-and-cut approach to global optimization
Tawarmalani, M. and Sahinidis, N. V. (2005) · 2005
Cited alongside, same era.
Introduction to Stochastic Programming
Birge, J. R. and Louveaux, F. (2011) · 2011
Later among the works it cites.
Lift-and-project cuts for mixed integer convex programs
Bonami, P. (2011) · 2011
Later among the works it cites.
On convex relaxations for quadratically constrained quadratic programming
Anstreicher, K. M. (2012) · 2012
Later among the works it cites.
A conic integer programming approach to stochastic joint location-inventory problems
Atamtürk, A., Berenguer, G., and Shen, Z.-J. (2012) · 2012
Later among the works it cites.
An outer-inner approximation for separable mixed-integer nonlinear programs
Hijazi, H., Bonami, P., and Ouorou, A. (2013) · 2013
Later among the works it cites.
Evaluating performance of image segmentation criteria and techniques
Hochbaum, D. S., Lyu, C., and Bertelli, E. (2013) · 2013
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Service system design with immobile servers, stochastic demand, and congestion
Elhedhli, S. (2006) · 2006
Cited alongside, same era.
Stochastic shortest paths via quasi-convex maximization
Nikolova, E., Kelner, J., Brand, M., and Mitzenmacher, M. (2006) · 2006
Cited alongside, same era.
Cuts for conic mixed-integer programming
Atamtürk, A. and Narayanan, V. (2007) · 2007
Cited alongside, same era.
Algorithms for discrete and continuous multicommodity flow network interdiction problems
Lim, C. and Smith, J. C. (2007) · 2007
Cited alongside, same era.
Polymatroids and mean-risk minimization in discrete optimization
Atamtürk, A. and Narayanan, V. (2008) · 2008
Cited alongside, same era.
Capacitated warehouse location model with risk pooling
Özsen, L., Coullard, C. R., and Daskin, M. S. (2008) · 2008
Cited alongside, same era.
Later among the works it cites.
An artificial bee colony algorithm for the economic lot scheduling problem
Bulut, O. and Tasgetiren, M. F. (2014) · 2014
Later among the works it cites.
Near-optimal algorithms for capacity constrained assortment optimization
Désir, A., Goyal, V., and Zhang, J. (2014) · 2014
Later among the works it cites.
A branch-and-cut algorithm for the latent-class logit assortment problem
Méndez-Díaz, I., Miranda-Bront, J. J., Vulcano, G., and Zabala, P. (2014) · 2014
Later among the works it cites.
Convex hull of two quadratic or a conic quadratic and a quadratic inequality
Modaresi, S. and Vielma, J. P. (2014) · 2014
Later among the works it cites.
Supermodular covering knapsack polytope
Atamtürk, A. and Bhardwaj, A. (2015) · 2015
Later among the works it cites.
A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization
Belotti, P., Góez, J. C., Pólik, I., Ralphs, T. K., and Terlaky, T. (2015) · 2015
Later among the works it cites.
On minimal valid inequalities for mixed integer conic programs
Kılınç-Karzan, F. (2015) · 2015
Later among the works it cites.
Two-term disjunctions on the second-order cone
Kılınç-Karzan, F. and Yıldız, S. (2015) · 2015
Later among the works it cites.
Şen, A., Atamtürk, A., and Kaminsky, P. (2015) · 2015
Later among the works it cites.
Polyhedral approximation in mixed-integer convex optimization
Lubin, M., Yamangil, E., Bent, R., and Vielma, J. P. (2016) · 2016
Later among the works it cites.
Intersection cuts for nonlinear integer programming: Convexification techniques for structured sets
Modaresi, S., Kılınç, M. R., and Vielma, J. P. (2016) · 2016
Later among the works it cites.
Ambiguous chance-constrained bin packing under mean-covariance information
Zhang, Y., Jiang, R., and Shen, S. (2016) · 2016
Later among the works it cites.
Successive quadratic upper-bounding for discrete mean-risk minimization and network interdiction
Atamtürk, A., Deck, C., and Jeon, H. (2017) · 2017
Closest in time.
Maximizing a class of utility functions over the vertices of a polytope
Atamtürk, A. and Gómez, A. (2017) · 2017
Closest in time.
Lifted polymatroid inequalities for mean-risk optimization with indicator variables
Atamtürk, A. and Jeon, H. (2017) · 2017
Closest in time.
How to convexify the intersection of a second order cone and a nonconvex quadratic
Burer, S. and Kılınç-Karzan, F. (2017) · 2017
Closest in time.
Some cut-generating functions for second-order conic sets
Santana, A. and Dey, S. S. (2017) · 2017
Closest in time.
Polyhedral results for a class of cardinality constrained submodular minimization problems
Yu, J. and Ahmed, S. (2017) · 2017
Closest in time.
Strong formulations for quadratic optimization with M-matrices and indicator variables
Atamtürk, A. and Gómez, A. (2018) · 2018
Closest in time.
Strong formulations for conic quadratic optimization with indicator variables
Gómez, A. (2018) · 2018
Closest in time.