Sciweavers

2864 search results - page 161 / 573
» Constraint Programming in OPL
Sort
View
ANOR
2005
124views more  ANOR 2005»
13 years 9 months ago
On Compact Formulations for Integer Programs Solved by Column Generation
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...
Daniel Villeneuve, Jacques Desrosiers, Marco E. L&...
SODA
2008
ACM
71views Algorithms» more  SODA 2008»
13 years 10 months ago
Two-phase greedy algorithms for some classes of combinatorial linear programs
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 ...
Ulrich Faigle, Britta Peis
IPCO
2010
153views Optimization» more  IPCO 2010»
13 years 7 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
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...
Christoph Buchheim, Alberto Caprara, Andrea Lodi
LPNMR
2007
Springer
14 years 3 months ago
Programming Applications in CIFF
We show how to deploy the CIFF System 4.0 for abductive logic programming with constraints in a number of applications, ranging from combinatorial applications to web management. W...
Paolo Mancarella, Fariba Sadri, Giacomo Terreni, F...
ORL
2008
50views more  ORL 2008»
13 years 9 months ago
Exploiting equalities in polynomial programming
We propose a novel solution approach for polynomial programming problems with equality constraints. By means of a generic transformation, we show that solution schemes for the (ty...
Javier Peña, Juan Carlos Vera, Luis F. Zulu...