Computation of approximate α-points for large scale single machine scheduling problem
Computers and Operations Research
A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Monotonizing linear programs with up to two nonzeroes per column
Operations Research Letters
Piecewise-quadratic Approximations in Convex Numerical Optimization
SIAM Journal on Optimization
Hi-index | 0.01 |
The semimetric polytope is an important polyhedral structure lying at the heart of several hard combinatorial problems. Therefore, linear optimization over the semimetric polytope is crucial for a number of relevant applications. Building on some recent polyhedral and algorithmic results about a related polyhedron, the rooted semimetric polytope, we develop and test several approaches, based over Lagrangian relaxation and application of Non Differentiable Optimization algorithms, for linear optimization over the semimetric polytope. We show that some of these approaches can obtain very accurate primal and dual solutions in a small fraction of the time required for the same task by state-of-the-art general purpose linear programming technology. In some cases, good estimates of the dual optimal solution (but not of the primal solution) can be obtained even quicker.