Abstract We show that if one can find the optimal value of an integer programming problem min{cx : Ax ≥ b, x ∈ Zn +} in polynomial time, then one can find an optimal solution...
James B. Orlin, Abraham P. Punnen, Andreas S. Schu...
—We develop a stochastic local search algorithm for finding Pareto points for multi-criteria optimization problems. The algorithm alternates between different single-criterium o...
Abstract— In previous work, we have shown that both unsupervised feature selection and the semi-supervised clustering problem can be usefully formulated as multiobjective optimiz...
A central problem in bioinformatics and systems biology is the selection of appropriate models in a rational and systematic way. This fundamentally combinatorial problem can be re...
Eric Yang, Timothy Maguire, Martin L. Yarmush, Ioa...