879 search results - page 25 / 176 » A Constraint Programming Approach for the Service Consolidat... |
108
click to vote
CSCLP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
110
Voted
AIR
2004
15 years 10 days ago
2004
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...
106
Voted
CPAIOR
2010
Springer
15 years 5 months ago
2010
Springer
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
112
click to vote
CSCLP
2006
Springer
15 years 4 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
115
Voted
ANOR
2005
15 years 11 days ago
2005
This paper presents a review of advances in the mathematical programming approach to discrete/continuous optimization problems. We first present a brief review of MILP and MINLP f...