In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We propose a finitely convergent convex hull tree algorithm which constructs a linear program that has the same optimal solution as the associated MILP. In addition, we combine the standard notion of sequential cutting planes...

Plain vanilla K-means clustering is prone to produce unbalanced clusters and suffers from outlier sensitivity. To mitigate both shortcomings, we formulate a joint outlier-detection and clustering problem, which assigns a prescribed number of datapoints to an auxiliary outlier cluster and performs cardinality-constrained K-means clustering on the residual dataset. We cast this problem as a mixed...

the capacitated location-routing problem (clrp) is a new research area in logistics and distribution management. this problem combines two difficult problems: the facility location problem (flp) and vehicle routing problem (vrp). the goal of the clrp is to open a subset of depots, assign the customers into open facilities, and then design vehicle tours in order to minimize the total cost. the t...

the selection of best information system (is) project from many competing proposals is a critical business activity which is very helpful to all organizations. while previous is project selection methods are useful but have restricted application because they handle only cases with precise data. indeed, these methods are based on precise data with less emphasis on imprecise data. this paper pro...

Modularity density maximization is a clustering method that improves some issues of the commonly-used modularity maximization approach. Recently, some Mixed-Integer Linear Programming (MILP) reformulations have been proposed in the literature for the modularity density maximization problem, but they require as input the solution of a set of auxiliary binary Non-Linear Programs (NLPs). These can...

In this study, the problem of project selection and scheduling with resource management is considered setup times, dynamic arrivals, priorities relationship between projects. A fuzzy multi-objective mixed integer linear programming (MILP) model proposed for solution problem. The classic two-phase goal (FGP) approach modified to solve MILP model. addressed defined over a construction company. ef...

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)...

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...