Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
Abstract-- Given a family of real or complex monic polynomials of fixed degree with one fixed affine constraint on their coefficients, consider the problem of minimizing the root r...
Vincent D. Blondel, Mert Gurbuzbalaban, Alexandre ...
Abstract. Evolutionary algorithms have been quite effective in dealing with single-objective “optimization” while the area of Evolutionary Multiobjective Optimization (EMOO) h...
extended abstract we report on work in progress carried out within the framework of the NWO project Realising Optimal Sharing. Instead of discussing optimal reduction in the λ-cal...