Sciweavers

10493 search results - page 200 / 2099
» Dynamic Word Problems
Sort
View
MP
1998
117views more  MP 1998»
13 years 8 months ago
The node capacitated graph partitioning problem: A computational study
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
Carlos Eduardo Ferreira, Alexander Martin, C. Carv...
SIAMJO
2002
115views more  SIAMJO 2002»
13 years 7 months ago
Superlinearly Convergent Algorithms for Solving Singular Equations and Smooth Reformulations of Complementarity Problems
We propose a new algorithm for solving smooth nonlinear equations in the case where their solutions can be singular. Compared to other techniques for computing singular solutions, ...
Alexey F. Izmailov, Mikhail V. Solodov
COLOGNETWENTE
2010
13 years 5 months ago
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...
SIAMNUM
2011
110views more  SIAMNUM 2011»
13 years 3 months ago
A Posteriori Error Control for Discontinuous Galerkin Methods for Parabolic Problems
We derive energy-norm a posteriori error bounds for an Euler timestepping method combined with various spatial discontinuous Galerkin schemes for linear parabolic problems. For acc...
Emmanuil H. Georgoulis, Omar Lakkis, Juha M. Virta...
SIAMCO
2010
124views more  SIAMCO 2010»
13 years 3 months ago
Reachability and Minimal Times for State Constrained Nonlinear Problems without Any Controllability Assumption
We consider a target problem for a nonlinear system under state constraints. We give a new continuous level-set approach for characterizing the optimal times and the backward-reach...
Olivier Bokanowski, Nicolas Forcadel, Hasnaa Zidan...