Sciweavers

2725 search results - page 23 / 545
» Constraint Solving for Interpolation
Sort
View
AIPS
2008
14 years 5 days ago
Using Constraint Networks on Timelines to Model and Solve Planning and Scheduling Problems
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...
Cédric Pralet, Gérard Verfaillie
HEURISTICS
2002
146views more  HEURISTICS 2002»
13 years 9 months ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...
CSCLP
2005
Springer
14 years 3 months ago
A Hybrid Benders' Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
Armagan Tarim, Ian Miguel
FLAIRS
2006
13 years 11 months ago
Which Dynamic Constraint Problems Can Be Solved By Ants?
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
Koenraad Mertens, Tom Holvoet, Yolande Berbers
TNN
2008
108views more  TNN 2008»
13 years 9 months ago
A Novel Recurrent Neural Network for Solving Nonlinear Optimization Problems With Inequality Constraints
This paper presents a novel recurrent neural network for solving nonlinear optimization problems with inequality constraints. Under the condition that the Hessian matrix of the ass...
Youshen Xia, Gang Feng, Jun Wang