We consider the following Colourful generalization of Linear programming: given sets of points S 1, ..., S k ⊂ d, referred to as colours, and a point b Ε d, decide whether there is a colourful T = {s 1,...,s k } such...
详细信息
A binary clutter is the family of inclusionwise minimal supports of vectors of affine spaces over GF(2). Binary clutters generalize various objects studied in combinatorialoptimization, such as paths, Chinese Postman...
详细信息
We present a general framework for designing semidefinite relaxations for constrained 0-1 quadratic programming and show how valid inequalities of the cut-polytope can be used to strengthen these relaxations. As examp...
详细信息
We introduce the concept of weak fc-majorization extending the classical notion of weak sub-majorization. For integers k and n with k ≤ n a vector x ϵ n is weakly k-majorized by a vector q ϵ kif the sum of the r larg...
详细信息
this paper demonstrates the use of hidden network structure for the solution of set partitioning problems. By finding a hidden network row suhmatrix, the set partitioning problem is transformed to a network with side ...
详细信息
We present a framework for automatic tightening of general 0-1 programs. A given constraint is tightened by using its own structure as well as information from other constraints. Our approach exploits special structur...
详细信息
Given a graph G, we introduce several classes of valid inequalities, called wheel inequalities, for the stable set polytope of G. Moreover, we show that the corresponding separation problems can be solved in pol...
详细信息
the Bounded Knapsack Problem (BKP) is a generalization of the 0-1 Knapsack Problem where a bounded amount of each item type is available. the currently most efficient algorithm for BKP transforms the data instance to ...
详细信息
暂无评论