نتایج جستجو برای: mixed integer quadratic programming
تعداد نتایج: 609483 فیلتر نتایج به سال:
We describe here a method for building a support vector machine (SVM) with integer parameters. Our method is based on a branchand-bound procedure, derived from modern mixed integer quadratic programming solvers, and is useful for implementing the feedforward phase of the SVM in fixed–point arithmetic. This allows the implementation of the SVM algorithm on resource–limited hardware like, for exa...
In this paper we analyze the parallel approximability of two special classes of Quadratic Programming. First, we consider Convex Quadratic Programming. We show that the problem of Approximating Convex Quadratic Programming is P-complete. We also consider two approximation problems related to it, Solution Approximation and Value Approximation and show both of these cannot be solved in NC, unless...
Flow shop scheduling problem with missing operations is studied in this paper. Missing operations assumption refers to the fact that at least one job does not visit one machine in the production process. A mixed-binary integer programming model has been presented for this problem to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the optimization...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید