3433 search results - page 36 / 687 » Heuristics for a bidding problem |
DISOPT
2007
13 years 7 months ago
2007
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important (NP-complete) problem that can be extremely hard in practice. Very recently, Fisch...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Because of the large number of possible combinations for the fuel assembly loading in the core, the design of the loading pattern (LP) is a complex optimization problem. It requir...
FGCS
2000
13 years 7 months ago
2000
The problem considered in this paper consists in defining an assignment of frequencies to radio links, to be established between base stations and mobile transmitters, which minim...
ASIAMS
2007
IEEE
14 years 2 months ago
2007
IEEE
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...