18 search results - page 3 / 4 » A Branch and Bound Algorithm for Numerical MAX-CSP |
AMC
2005
13 years 7 months ago
2005
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
ICGA
1997
13 years 8 months ago
1997
This paper presents a genetic algorithm (GA) with specialized encoding, initialization and local search genetic operators to optimize communication network topologies. This NPhard...
EOR
2006
13 years 7 months ago
2006
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment...
ISSAC
1997
Springer
1997
Springer
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
13 years 11 months ago
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
IJON
2007
13 years 7 months ago
2007
Piecewise linear networks (PLNs) are attractive because they can be trained quickly and provide good performance in many nonlinear approximation problems. Most existing design alg...