Sciweavers

6562 search results - page 128 / 1313
» Noetherianity and Combination Problems
Sort
View
DAM
2006
78views more  DAM 2006»
15 years 4 months ago
Hybrid rounding techniques for knapsack problems
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
Monaldo Mastrolilli, Marcus Hutter
EOR
2006
134views more  EOR 2006»
15 years 4 months ago
A smoothing heuristic for a bilevel pricing problem
In this paper, we provide a heuristic procedure, that performs well from a global optimality point of view, for an important and difficult class of bilevel programs. The algorithm...
Jean-Pierre Dussault, Patrice Marcotte, Séb...
JUCS
2008
170views more  JUCS 2008»
15 years 4 months ago
Intelligent Resource Exchanges: Solutions and Pathways in a Workforce Allocation Problem
: This paper considers the problem of resource allocation in the service industries approached from an agent-based perspective. Agent technologies seem to be well suited to this do...
Botond Virginas, Marian Florin Ursu, Edward P. K. ...
COMPUTING
2002
93views more  COMPUTING 2002»
15 years 4 months ago
Non-Nested Multi-Level Solvers for Finite Element Discretisations of Mixed Problems
We consider a general framework for analysing the convergence of multi-grid solvers applied to finite element discretisations of mixed problems, both of conforming and nonconformi...
V. John, P. Knobloch, Gunar Matthies, Lutz Tobiska
FOCM
2002
83views more  FOCM 2002»
15 years 4 months ago
A Rigorous ODE Solver and Smale's 14th Problem
We present an algorithm for computing rigorous solutions to a large class of ordinary differential equations. The main algorithm is based on a partitioning process and the use of i...
Warwick Tucker