Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Oxford, UK : Blackwell Publishing Ltd
    Annals of the New York Academy of Sciences 90 (1960), S. 0 
    ISSN: 1749-6632
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Natural Sciences in General
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Cellular and molecular life sciences 8 (1952), S. 428-429 
    ISSN: 1420-9071
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Medicine
    Notes: Summary The tissues of numerous marine invertebrates of various zoological groups contain anL-aminoacidoxydase different to that of many vertebrates (apart from theL-ophioaminoacidoxydase). This enzyme acts on the basic amino acids, especially on arginine; it metabolizes the latter according to a process different to that common to vertebrates, based on arginase action. The presence of α-keto-δ-guanidovaleric and γ-guanidobutyric acids in the tissues of various invertebrates is due to this metabolic decomposition of arginine.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Computational optimization and applications 10 (1998), S. 149-163 
    ISSN: 1573-2894
    Keywords: quadratic integer programming ; branch and bound algorithms ; concave minimization ; global optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We consider the problem of minimizing a general quadratic function over a polytope in the n-dimensional space with integrality restrictions on all of the variables. (This class of problems contains, e.g., the quadratic 0-1 program as a special case.) A finite branch and bound algorithm is established, in which the branching procedure is the so-called “integral rectangular partition”, and the bound estimation is performed by solving a concave programming problem with a special structure. Three methods for solving this special concave program are proposed.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...