Semidefinite programming in combinatorial optimization
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
Mathematical Programming: Series A and B
Lectures on modern convex optimization: analysis, algorithms, and engineering applications
Lectures on modern convex optimization: analysis, algorithms, and engineering applications
Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
Discrete Applied Mathematics
Convexification and Global Optimization in Continuous And
Convexification and Global Optimization in Continuous And
Cuts for mixed 0-1 conic programming
Mathematical Programming: Series A and B
Perspective cuts for a class of convex 0–1 mixed integer programs
Mathematical Programming: Series A and B
A survey of scheduling with controllable processing times
Discrete Applied Mathematics
An anticipative scheduling approach with controllable processing times
Computers and Operations Research
Parallel machine match-up scheduling with manufacturing cost considerations
Journal of Scheduling
Projected Perspective Reformulations with Applications in Design Problems
Operations Research
| Hi-index | 0.00 |
We describe a polynomial-size conic quadratic reformulation for a machine-job assignment problem with separable convex cost. Because the conic strengthening is based only on the objective of the problem, it can also be applied to other problems with similar cost functions. Computational results demonstrate the effectiveness of the conic reformulation.