We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, ...
In this paper, we investigate cyclic sequences which contain as elements all k-subsets of {0, 1, . . . , n-1} exactly once such that the unions of any two consecutive k-subsets of...
A nonincreasing sequence of nonnegative integers = (d1, d2, ..., dn) is graphic if there is a (simple) graph G of order n having degree sequence . In this case, G is said to reali...
Guantao Chen, Michael Ferrara, Ronald J. Gould, Jo...
Catalan numbers C(n) = 1 n+1 2n n enumerate binary trees and Dyck paths. The distribution of paths with respect to their number k of factors is given by ballot numbers B(n, k) = n-...