A strong conic quadratic reformulation for machine-job assignment with controllable processing times
From MaRDI portal
Publication:833574
DOI10.1016/j.orl.2008.12.009zbMath1167.90518OpenAlexW2047688435MaRDI QIDQ833574
Sinan Gürel, M. Selim Akturk, Atamtürk, Alper
Publication date: 14 August 2009
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/22764
Related Items
Gaining or losing perspective, On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables, A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes, Perspective Reformulation and Applications, A polyhedral study of production ramping, Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints, An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems, Perspective reformulations of mixed integer nonlinear programs with indicator variables, Strong formulations for quadratic optimization with M-matrices and indicator variables, Stochastic lot sizing problem with nervousness considerations, An anticipative scheduling approach with controllable processing times, Aircraft Rescheduling with Cruise Speed Control, Perspective Reformulations of the CTA Problem with L2 Distances, A Scalable Algorithm for Sparse Portfolio Selection, Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach, Recent advances in mathematical programming with semi-continuous variables and cardinality constraint, A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times, A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function, The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables, Quadratic Convex Reformulations for Semicontinuous Quadratic Programming, A new perspective on low-rank optimization, \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables, A computational study of perspective cuts, Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables, A graph-based decomposition method for convex quadratic optimization with indicators, Lifting for conic mixed-integer programming, Lifted polymatroid inequalities for mean-risk optimization with indicator variables, On the convex hull of convex quadratic optimization problems with indicators, Unnamed Item, Supermodularity and valid inequalities for quadratic optimization with indicators, Demand allocation with latency cost functions, Mixed-integer nonlinear programs featuring ``on/off constraints, Submodularity in Conic Quadratic Mixed 0–1 Optimization, A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints, Quadratic cone cutting surfaces for quadratic programs with on-off constraints, Parallel machine match-up scheduling with manufacturing cost considerations, A conic quadratic formulation for a class of convex congestion functions in network flow problems, Strong formulations for conic quadratic optimization with indicator variables, Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions, Minimal conic quadratic reformulations and an optimization model, Quadratic optimization with switching variables: the convex hull for \(n=2\), Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions, Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization, Sparse regression at scale: branch-and-bound rooted in first-order optimization, On mathematical programming with indicator constraints, Ideal formulations for constrained convex optimization problems with indicator variables, Approximated perspective relaxations: a project and lift approach
Cites Work
- Considering manufacturing cost and scheduling performance on a CNC turning machine
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Semidefinite programming in combinatorial optimization
- Second-order cone programming
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- A survey of scheduling with controllable processing times
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Cuts for mixed 0-1 conic programming
- Lectures on Modern Convex Optimization
- Scheduling Multiple Variable-Speed Machines
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
