187 search results - page 5 / 38 » Benchmarking and solving dynamic constrained problems |
115
click to vote
CP
1998
Springer
15 years 1 months ago
1998
Springer
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
101
Voted
APAQS
2001
IEEE
15 years 1 months ago
2001
IEEE
Code-patterns are statically recurring structure specific to a programming language. It can be parallel to aid in designing software systems for solving particular problems. Contr...
CDC
2010
IEEE
2010
IEEE
Convergence of discrete-time approximations of constrained linear-quadratic optimal control problems
14 years 4 months ago
Abstract-- Continuous-time linear constrained optimal control problems are in practice often solved using discretization techniques, e.g. in model predictive control (MPC). This re...
ASPDAC
1999
ACM
15 years 1 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
SUTC
2006
IEEE
15 years 3 months ago
2006
IEEE
We propose and formally characterize a new problem named the dynamic context coverage problem in capabilityconstrained mobile sensor network environments. The goal is to move and ...