4047 search results - page 192 / 810 » The Discrete Basis Problem |
165
Voted
SODA
2010
ACM
16 years 26 days ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
144
click to vote
CCO
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
140
Voted
WEA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
144
Voted
TOMS
1998
15 years 3 months ago
1998
This paper presents the software architecture and implementation of the problem solving environment (PSE) PELLPACK for modeling physical objects described by partial differential ...
128
Voted
SIAMNUM
2010
14 years 10 months ago
2010
A Balancing Domain Decomposition Method by Constraints (BDDC) is constructed and analyzed for the Reissner-Mindlin plate bending problem discretized with MITC finite elements. This...