14 search results - page 2 / 3 » A domain decomposition solver for ferromagnetism |
WEA
2010
Springer
14 years 9 days ago
2010
Springer
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
EUROPAR
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decompositi...
CP
2009
Springer
14 years 8 days ago
2009
Springer
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
ATAL
2011
Springer
12 years 5 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
CP
2010
Springer
13 years 4 months ago
2010
Springer
Given an arbitrary constraint c on n variables with domain size d, we show how to generate a custom propagator that establishes GAC in time O(nd) by precomputing the propagation th...