Results 211 to 220 of about 41,581 (262)

Analysis of cutting ballon versus plain balloon dilatation after electrified wire in situ fenestration. [PDF]

JVS Vasc Sci
Silvano M, Ormandzhieva T, Grambow E, Elger F.   +3 more
europepmc   +1 more source

Bioremediation of heavy metal contamination: recent developments and future directions. [PDF]

Sci Rep
Xu X, Augustyniak M, Chakrabarty D, Chowdhury A, Gunasekaran S.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Geometry of branch cuts

ACM Communications in Computer Algebra, 2011
The word ‘Simplification’ is often used in Computer Algebra. However, the task is not simple even with the aids of modern Computer Algebra Systems (CASs). Not only ones face questions such as ‘is expression f simpler than expression g?’, but many well-known formulae are not true on some points, lines or regions due to the fact that the elementary ...
Nalina Phisanbut, Russell J. Bradford, James H. Davenport   +2 more
openaire   +1 more source

A note on branch-and-cut-and-price

Operations Research Letters, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dominique Feillet, Michel Gendreau, Andrés L. Medaglia, Jose L. Walteros   +3 more
openaire   +3 more sources

Branch cuts in the phase function

Applied Optics, 1992
It is shown that, when the scalar field associated with the propagation of a distorted wave function has nulls in its intensity pattern, the phase function that goes with that scalar field has branch points at the location of these nulls and that there are unavoidable 2pi discontinuities across the associated branch cuts in the phase function.
D L, Fried, J L, Vaughn
openaire   +2 more sources

Branch cuts in computer algebra

Proceedings of the international symposium on Symbolic and algebraic computation - ISSAC '94, 1994
Most computer algebra systems provide little assistance in working with expressions involving functions with complex branch cuts. Worse, by their ignorance of the existence of branch cuts, algebra systems sometimes simplify complex expressions incorrectly.
Adam Dingle, Richard J. Fateman
openaire   +1 more source

Branch-and-Cut

2010
This chapter focuses on the approach for solving the LOP to optimality which can currently be seen as the most successful one. It is a branch-and-bound algorithm, where the upper bounds are computed using linear programming relax- ations.
Rafael Martí, Gerhard Reinelt
openaire   +1 more source

Cutting planes for branch‐and‐price algorithms

Networks, 2011
AbstractThis article presents a general framework for formulating cutting planes in the context of column generation for integer programs. Valid inequalities can be derived using the variables of an equivalent compact formulation (i.e., the subproblem variables) or the master problem variables.
Guy Desaulniers, Jacques Desrosiers, Simon Spoorendonk   +2 more
openaire   +1 more source

CUTTING THE BRANCHES FOR AKIBA:

2005
This article appears in an anthology of essays that consider the political thought of one of Europe's leading contemporary philosophers, Giorgio Agamben. Agamben is not yet well-known in the Anglo-American legal academy, but this has been changing recently with the publication of a series of books (collectively titled Homo Sacer) that address, at a ...
openaire   +1 more source

Branch-and-Cut versus Cut-and-Branch Algorithms for Cell Suppression

2010
This paper discusses several techniques to apply Cell Suppression Methodology to protect private information when publishing tabular data. All techniques are exact algorithms to find optimal suppression patterns, but they can also be used as heuristic approaches to find good suppression patterns.
openaire   +1 more source