32 search results - page 2 / 7 » Branch and Recharge: Exact Algorithms for Generalized Domina... |
EOR
2006
13 years 6 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...
WG
2009
Springer
14 years 17 days ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
CP
2008
Springer
13 years 7 months ago
2008
Springer
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
PE
2011
Springer
13 years 10 days ago
2011
Springer
We introduce a new solution technique for closed product-form queueing networks that generalizes the Method of Moments (MoM), a recently proposed exact algorithm that is several o...
SEAL
1998
Springer
13 years 10 months ago
1998
Springer
Abstract. This paper extends the N-person IPD game into a more interesting game in economics, namely, the oligopoly game. Due to its market share dynamics, the oligopoly game is mo...