2974 search results - page 169 / 595 » Model-Driven Constraint Programming |
163
click to vote
ANOR
2005
15 years 6 months ago
2005
Column generation has become a powerful tool in solving large scale integer programs. It is well known that most of the often reported compatibility issues between pricing subprobl...
148
click to vote
COR
2011
15 years 1 months ago
2011
Branching in mixed-integer (or integer) linear programming requires choosing both the branching variable and the branching direction. This paper develops a number of new methods f...
195
click to vote
OL
2011
14 years 9 months ago
2011
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
161
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...
189
click to vote
IPCO
2010
15 years 4 months ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...