Today’s compilers have a plethora of optimizations to choose from, and the correct choice of optimizations can have a significant impact. Furthermore, choosing the correct order in which to apply those optimizations has been a long standing problem in compilation research. Traditional compilers typically apply the same set of optimization in a fixed order to all functions in a program, without ...

The TiC1−xNx system has long been prized in industry because of its desirable thermodynamic and hardness characteristics. Previous studies have not produced comprehensive results describing the ordering tendencies of TiC1−xNx at any temperature. We apply the mixed-basis cluster expansion and Monte Carlo methods to the problem and find a fascinating array of ground-state structures occurring at ...

Several optimization problems require finding a permutation of a given set of items that minimizes a certain cost function. These problems are naturally modelled in graph-theory terms by introducing a complete digraph G = (V, A) whose vertices v ∈ V := {1, · · · , n} correspond to the n items to be sorted. Depending on the cost function to be be used, different optimization problems can be defi...

Multiobjective optimization problems with a variable ordering structure instead of a partial ordering have recently gained interest due to several applications. In the last years a basic theory has been developed for such problems. The difficulty in their study arises from the fact that the binary relations of the variable ordering structure, which are defined by a cone-valued map which associa...

In this article, we propose a multiple objective optimization based approach for the short term scheduling of batch plants to select superior solutions when compared to the single objective problem. Two alternate approaches to optimality, viz. lexicographic and pareto-optimality based formulations are considered here. We demonstrate the suitability of lexicographic optimization for the case whe...

We study the structure of dual optimization problems associated with linear constraints, bounds on the variables, and separable cost. We show how the separability of the dual cost function is related to the sparsity structure of the linear equations. As a result, techniques for ordering sparse matrices based on nested dissection or graph partitioning can be used to decompose a dual optimization...

This research studies a single-period expected utility-based optimal portfolio problem. Assets are divided into different groups. It is assumed that the actual dependency structure of the asset returns within each group is unknown, but assets belonging to different groups have independent returns. Instead of assuming any particular dependency structure within each group, we propose the maximin ...

in this article, multiple-product pvrp with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. a mathematical formulation was provided for this problem. each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. to solve the problem, two meta-heuristic methods...