Pages that link to "Item:Q833574"
From MaRDI portal
The following pages link to A strong conic quadratic reformulation for machine-job assignment with controllable processing times (Q833574):
Displaying 48 items.
- Approximated perspective relaxations: a project and lift approach (Q263157) (← links)
- A polyhedral study of production ramping (Q304233) (← links)
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint (Q384213) (← links)
- Mixed-integer nonlinear programs featuring ``on/off'' constraints (Q453616) (← links)
- Lifting for conic mixed-integer programming (Q623366) (← links)
- A conic quadratic formulation for a class of convex congestion functions in network flow problems (Q713098) (← links)
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes (Q833581) (← links)
- Parallel machine match-up scheduling with manufacturing cost considerations (Q969751) (← links)
- Strong formulations for quadratic optimization with M-matrices and indicator variables (Q1650773) (← links)
- Stochastic lot sizing problem with nervousness considerations (Q1652600) (← links)
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints (Q1751215) (← links)
- Strong formulations for conic quadratic optimization with indicator variables (Q2039236) (← links)
- Quadratic optimization with switching variables: the convex hull for \(n=2\) (Q2044962) (← links)
- Sparse regression at scale: branch-and-bound rooted in first-order optimization (Q2097642) (← links)
- Ideal formulations for constrained convex optimization problems with indicator variables (Q2118117) (← links)
- Gaining or losing perspective (Q2124806) (← links)
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function (Q2181606) (← links)
- Minimal conic quadratic reformulations and an optimization model (Q2294364) (← links)
- On mathematical programming with indicator constraints (Q2349121) (← links)
- Lifted polymatroid inequalities for mean-risk optimization with indicator variables (Q2423781) (← links)
- Demand allocation with latency cost functions (Q2429466) (← links)
- Perspective reformulations of mixed integer nonlinear programs with indicator variables (Q2638370) (← links)
- An anticipative scheduling approach with controllable processing times (Q2654388) (← links)
- A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times (Q2668748) (← links)
- The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables (Q2670502) (← links)
- Perspective Reformulation and Applications (Q2897294) (← links)
- Aircraft Rescheduling with Cruise Speed Control (Q2931703) (← links)
- Perspective Reformulations of the CTA Problem with <i>L</i><sub>2</sub> Distances (Q2931708) (← links)
- Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach (Q2940060) (← links)
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables (Q3503836) (← links)
- (Q4998944) (← links)
- Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization (Q5010043) (← links)
- On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables (Q5041763) (← links)
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints (Q5060505) (← links)
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems (Q5060779) (← links)
- A Scalable Algorithm for Sparse Portfolio Selection (Q5087719) (← links)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
- A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints (Q5158761) (← links)
- Quadratic Convex Reformulations for Semicontinuous Quadratic Programming (Q5348460) (← links)
- Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions (Q5918407) (← links)
- Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions (Q5925583) (← links)
- A new perspective on low-rank optimization (Q6052053) (← links)
- \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables (Q6052055) (← links)
- A computational study of perspective cuts (Q6062884) (← links)
- A graph-based decomposition method for convex quadratic optimization with indicators (Q6102761) (← links)
- On the convex hull of convex quadratic optimization problems with indicators (Q6120854) (← links)
- Supermodularity and valid inequalities for quadratic optimization with indicators (Q6165587) (← links)
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones (Q6498414) (← links)