Supplier selection is one of the influential decisions for effectiveness of purchasing and manufacturing policies under competitive conditions of the market. Regarding the fact that decision makers (DMs) consider conflicting criteria for selecting suppliers, multiple-criteria programming is a promising approach to solve the problem. This paper develops a nadir compromise programming (NCP) model...

A discontinuity exists between modeling and objectoriented programming languages. This discontinuity is a consequence of ambiguous notions in modeling languages and lack of corresponding notions in objectoriented programming languages. It hinders the transition between software implementation and design and hampers software maintenance. This discontinuity is particularly acute for binary class ...

This paper reports on a novel approach to binary image deconvolution using Positive Semidefinite (PSD) Programming. We note the combinatorial nature of this problem: binary image deconvolution requires the minimization of a global energy function over binary variables, taking into account not only both local similarity and spatial context, but more specifically the relationship between individu...

REPORTRAPPORT A linear-time transformation of linear inequalities into conjunctive normal form Abstract We present a technique that transforms any binary programming problem with integral coeecients to a satissability problem of propositional logic in linear time. Preliminary computational experience using this transformation, shows that a pure logical solver can be a valuable tool for solving ...

Let A(n, d, w) be the largest possible size of an (n, d, w) constant-weight binary code. By adding new constraints to Delsarte linear programming, we obtain twenty three new upper bounds on A(n, d, w) for n ≤ 28. The used techniques allow us to give a simple proof of an important theorem of Delsarte which makes linear programming possible for binary codes.

In this lecture we introduce dynamic programming, which is a high-level computational thinking concept rather than a concrete algorithm. Perhaps a more descriptive title for the lecture would be sharing, because dynamic programming is about sharing computation. We have already seen earlier that sharing of space is also crucial: binary decision diagrams in which subtrees are shared are (in pract...

Let Y be a convex set inRk defined by polynomial inequalities and equations of degree at most d ≥ 2 with integer coefficients of binary length at most l. We show that if the set of optimal solutions of the integer programming problem min{yk | y = (y1, . . . , yk) ∈ Y ∩Zk} is not empty, then the problem has an optimal solution y∗ ∈ Y ∩Zk of binary length ld O(k ). For fixed k, our bound implies ...