ACM SIGNUM Newsletter
Double Description Method Revisited
Selected papers from the 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics and Computer Science
IBM Journal of Research and Development
Interval Analysis on Directed Acyclic Graphs for Global Optimization
Journal of Global Optimization
New formulations for the Kissing Number Problem
Discrete Applied Mathematics
Branching and bounds tighteningtechniques for non-convex MINLP
Optimization Methods & Software - GLOBAL OPTIMIZATION
On convex relaxations of quadrilinear terms
Journal of Global Optimization
Experiments with a feasibility pump approach for nonconvex MINLPs
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Reformulations in mathematical programming: automatic symmetry detection and exploitation
Mathematical Programming: Series A and B
Feasibility-based bounds tightening via fixed points
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Hi-index | 0.00 |
Most optimization software performs numerical computation, in the sense that the main interest is to find numerical values to assign to the decision variables, e.g. a solution to an optimization problem. In mathematical programming, however, a considerable amount of symbolic transformation is essential to solving difficult optimization problems, e.g. relaxation or decomposition techniques. This step is usually carried out by hand, involves human ingenuity, and often constitutes the "theoretical contribution" of some research papers. We describe a Reformulation-Optimization Software Engine (ROSE) for performing (automatic) symbolic computation on mathematical programming formulations.