A strong conic quadratic reformulation for machine-job assignment with controllable processing times
From MaRDI portal
Publication:833574
DOI10.1016/J.ORL.2008.12.009zbMATH Open1167.90518OpenAlexW2047688435MaRDI QIDQ833574FDOQ833574
Authors: Sinan Gürel, M. Selim Aktürk, Alper Atamtürk 
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
Recommendations
- Convex quadratic programming relaxations for parallel machine scheduling with controllable processing times subject to release times
- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
- A convex form of the quadratic assignment problem
- Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs
Cites Work
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- A survey of scheduling with controllable processing times
- Second-order cone programming
- Perspective cuts for a class of convex 0-1 mixed integer programs
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Cuts for mixed 0-1 conic programming
- Scheduling Multiple Variable-Speed Machines
- Semidefinite programming in combinatorial optimization
- Considering manufacturing cost and scheduling performance on a CNC turning machine
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
Cited In (49)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Approximated perspective relaxations: a project and lift approach
- Improving the performance of MIQP solvers for quadratic programs with cardinality and minimum threshold constraints: a semidefinite program approach
- An anticipative scheduling approach with controllable processing times
- Quadratic optimization with switching variables: the convex hull for \(n=2\)
- A unified approach to mixed-integer optimization problems with logical constraints
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- Gaining or losing perspective
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- A conic quadratic formulation for a class of convex congestion functions in network flow problems
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
- A polyhedral study of production ramping
- \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables
- A graph-based decomposition method for convex quadratic optimization with indicators
- Title not available (Why is that?)
- Outlier detection in time series via mixed-integer conic quadratic optimization
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems
- Perspective reformulation and applications
- A computational study of perspective cuts
- Strong formulations for conic quadratic optimization with indicator variables
- Stochastic lot sizing problem with nervousness considerations
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- Aircraft rescheduling with cruise speed control
- Demand allocation with latency cost functions
- Lifting for conic mixed-integer programming
- Lifted polymatroid inequalities for mean-risk optimization with indicator variables
- Constrained optimization of rank-one functions with indicator variables
- A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times
- The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables
- Supermodularity and valid inequalities for quadratic optimization with indicators
- A new perspective on low-rank optimization
- On the convexification of constrained quadratic optimization problems with indicator variables
- Quadratic convex reformulations for semicontinuous quadratic programming
- Parallel machine match-up scheduling with manufacturing cost considerations
- Minimal conic quadratic reformulations and an optimization model
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
- Ideal formulations for constrained convex optimization problems with indicator variables
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- Mixed-integer nonlinear programs featuring ``on/off constraints
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- On mathematical programming with indicator constraints
- A Scalable Algorithm for Sparse Portfolio Selection
- Perspective reformulations of the CTA problem with \(L_2\) distances
- Sparse regression at scale: branch-and-bound rooted in first-order optimization
- On the convex hull of convex quadratic optimization problems with indicators
- Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions
- Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions
This page was built for publication: A strong conic quadratic reformulation for machine-job assignment with controllable processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833574)
