This paper proposes a relaxed algorithm based on mixed integer linear programming (MILP) to extend the LAD methodology to solve multi-class classification problems, where One-vs-Rest (OvR) learning models are constructed to classify observations in predefined classes. The suggested algorithm has two control parameters, homogeneity and prevalence, for improving the classification accuracy of the...

In the context of multiple constant multiplication (MCM) design, we propose a novel common sub-expression elimination (CSE) algorithm that models the optimal synthesis of coefficients into a 0-1 mixedinteger linear programming (MILP) problem with a user-defined generic logic depth constraint. We also propose an efficient solution space, which combines all minimal signed digit (MSD) representati...

State-of-the-art baggage handling systems transport luggage in an automated way using destination coded vehicles (DCVs). These vehicles transport the bags at high speeds on a “mini” railway network. In this paper we consider the problem of controlling the route of each DCV in the system. This is a nonlinear, nonconvex, mixed integer optimization problem. Nonlinear model predictive control (MPC)...

Solving constraints over oating-point numbers is a critical issue in numerous applications notably in program veri cation. Capabilities of ltering algorithms over the oating-point numbers (F) have been so far limited to 2b-consistency and its derivatives. Though safe, such ltering techniques su er from the well known pathological problems of local consistencies, e.g., inability to e ciently han...

Department of Chemical Engineering, Princeton University Princeton, N.J. 08544 In this paper, a novel formulation is presented for the short-term scheduling of batch plants. The proposed formulation is based on a continuous time representation and results in a Mixed Integer Linear Programming (MILP) problem. In contrast to the previously published continuous-time scheduling formulations, the pr...

Component deployment is a combinatorial optimisation problem in software engineering that aims at finding the best allocation of software components to hardware resources in order to optimise quality attributes, such as reliability. The problem is often constrained due to the limited hardware resources, and the communication network, which may connect only certain resources. Due to the non-line...

This paper presents a multiple time grid continuous time MILP model for the short-term scheduling of single stage, multiproduct batch plants where the objective is the minimization of total cost or total earliness. It can handle both release and due dates and it can determine the products delivery dates explicitly if these need to be considered in the objective function. This formulation is com...

In this paper a wide class of discrete optimization problems, which can be formulated as a 0-1 linear programming problem is discussed. It is assumed that the objective function costs are not precisely known. This uncertainty is modeled by specifying a finite set of fuzzy scenarios. Under every fuzzy scenario the costs are given as fuzzy intervals. Possibility theory is then applied to chose a ...

This paper presents a multi-week mixed integer linear programming (MILP) scheduling model for an ice cream processing facility. The ice cream processing is a typical complex food manufacturing process and a simplified version of this processing has been adapted to investigate scheduling problems in the literature. Most of these models only considered the production scheduling for a week. In thi...

We present optimal solutions to the test scheduling problem for core-based systems. Given a set of tasks (test sets for the cores), a set of test resources (e.g., test buses, BIST hardware) and a test access architecture, we determine start times for the tasks such that the total test application time is minimized. We show that the test scheduling decision problem is equivalent to the -processo...