ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Lagrangean relaxation  (1)
  • cis-platin  (1)
  • Springer  (2)
  • 1
    Electronic Resource
    Electronic Resource
    Porosified Silicon Wafer Structures Impregnated With Platinum Anti-Tumor Compounds: Fabrication, Characterization, and Diffusion Studies (2000)
    Springer
    Biomedical microdevices 2 (2000), S. 265-272 
    Details
    ISSN: 1572-8781
    Keywords: porous silicon ; cis-platin ; drug delivery ; calcium phosphate ; carbo-platin
    Source: Springer Online Journal Archives 1860-2000
    Topics: Medicine , Technology
    Notes: Abstract In this work, the incorporation and characterization of cis-platin (cis-diammine dichloroplatinum(II)), carbo-platin [cis-diammine(cyclobutane-1,1-dicarboxylato] platinum(II)), and Pt(en)Cl2 (ethylenediamminedichloro platinum(II)) within layers of calcium phosphate on porous Si/Si substrates are described. These materials have been characterized by scanning electron microscopy, secondary ion mass spectrometry, and X-ray energy dispersive spectroscopy. The diffusion of platinum species from the doped calcium phosphate layers has also been investigated by UV-visible absorption spectrometry and inductively-coupled plasma spectroscopy. The influence of initial platinum concentration, the impact of thermal annealing of the calcium phosphate/porous Si/Si matrix, as well as the effect of varying the ligand coordination sphere of the Pt complex on its ability to be delivered to the surroundings have also been analyzed. For the case of cis-platin, it is found that increasing the concentration of platinum complex in the electrolyte during cathodic growth of calcium phosphate results in a relatively greater concentration of Pt incorporated into the calcium phosphate layers and a larger amount of Pt which subsequently can be delivered to the surrounding medium upon exposure to solvent.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1009951121205
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A Truncated Exponential Algorithm for the Lightly Constrained Assignment Problem (1997)
    Springer
    Computational optimization and applications 8 (1997), S. 287-299 
    Details
    ISSN: 1573-2894
    Keywords: assignment problem ; integer programming ; Lagrangean relaxation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This manuscript presents a truncated branch-and-bound algorithm toobtain a near optimal solution for the constrained assignment problemin which there are only a few side constraints. At each node of thebranch-and-bound tree a lower bound is obtained by solving a singlyconstrained assignment problem. If needed, Lagrangean relaxationtheory is applied in an attempt to improve this lower bound. Aspecialized branching rule is developed which exploits therequirement that every man be assigned to some job. A softwareimplementation of the algorithm has been tested on problems with fiveside constraints and up to 75,000 binary variables. Solutionsguaranteed to be within 10% of an optimum were obtained for these75,000 variable problems in from two to twenty minutes of CPU time ona Dec Alpha workstation. The behavior of the algorithm for variousproblem characteristics is also studied. This includes the tightnessof the side constraints, the stopping criteria, and the effect whenthe problems are unbalanced having more jobs than men.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008679623419
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...