2244 search results - page 223 / 449 » A new heuristic approach for non-convex optimization problem... |
251
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
We present a new Feasibility Pump algorithm tailored for nonconvex Mixed Integer Nonlinear Programming problems. Differences with the previously proposed Feasibility Pump algorith...
203
click to vote
ATMOS
2007
15 years 8 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
230
click to vote
SSD
2005
Springer
16 years 22 days ago
2005
Springer
Abstract. Evacuation planning is critical for numerous important applications, e.g. disaster emergency management and homeland defense preparation. Efficient tools are needed to pr...
197
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
222
click to vote
CIDR
2011
14 years 10 months ago
2011
For some problems, human assistance is needed in addition to automated (algorithmic) computation. In sharp contrast to existing data management approaches, where human input is ei...