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
  • integer programming  (2)
  • Shortest-paths  (1)
  • cadmium sulfide  (1)
  • Springer  (4)
  • American Chemical Society (ACS)
  • 1
    Electronic Resource
    Electronic Resource
    Thermochemical Passivation of DNA-Stabilized Q-Cadmium Sulfide Nanoparticles (2000)
    Springer
    Journal of cluster science 11 (2000), S. 359-372 
    Details
    ISSN: 1572-8862
    Keywords: cadmium sulfide ; quantum dots ; DNA stabilized
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Physics
    Notes: Abstract In this work, the conditions required to transform quantum-confined cadmium sulfide (Q-CdS) nanoparticles stabilized by calf thymus deoxyribonucleic acid from deep trap photoluminescent states to “band edge”-type luminescence are probed. The presence of fivefold excess sulfide relative to cadmium concentration during cluster synthesis, followed by mild heating at 80°C, results in the desired transformation of the Q-CdS emission spectrum. We also indirectly analyze the accompanying structural changes in the polymeric stabilizer, accomplished in this case by use of well-known spectrofluorometric methods with the dyes ethidium bromide and trisphenanthroline ruthenium(II).
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1009049823345
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm (1993)
    Springer
    Computational optimization and applications 2 (1993), S. 47-75 
    Details
    ISSN: 1573-2894
    Keywords: Shortest-paths ; parallel algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Four new shortest-path algorithms, two sequential and two parallel, for the source-to-sink shortest-path problem are presented and empirically compared with five algorithms previously discussed in the literature. The new algorithm, S22, combines the highly effective data structure of the S2 algorithm of Dial et al., with the idea of simultaneously building shortest-path trees from both source and sink nodes, and was found to be the fastest sequential shortest-path algorithm. The new parallel algorithm, PS22, is based on S22 and is the best of the parallel algorithms. We also present results for three new S22-type shortest-path heuristics. These heuristics find very good (often optimal) paths much faster than the best shortest-path algorithm.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01299142
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    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
  • 4
    Electronic Resource
    Electronic Resource
    The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm (1994)
    Springer
    Computational optimization and applications 3 (1994), S. 7-26 
    Details
    ISSN: 1573-2894
    Keywords: network programming ; assignment ; integer programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This manuscript presents a new heuristic algorithm to find near optimal integer solutions for the singly constrained assignment problem. The method is based on Lagrangian duality theory and involves solving a series of pure assignment problems. The software implementation of this heuristic, ASSIGN+1, successfully solved problems having one-half million binary variables (assignment arcs) in less than 17 minutes of wall clock time on a Sequent Symmetry S81 using a single processor. In computational comparisons with MPSX and OSL on an IBM 3081D, the specialized software was from 100 to 1,000 times faster. In computational comparisons with the specialized code of Mazzola and Neebe, we found that ASSIGN+1 was 40 times faster. In computational comparisons with our best alternating path specialized code, we found that ASSIGN+1 was more than three times faster than that code. This new software proved to be very robust as well as fast. The robustness is due to an elaborate scheme used to update the Lagrangean multipliers and the speed is due to the fine code used to solve the pure assignment problems. We also present a modification of the algorithm for the case in which the number of jobs exceeds the number of men along with an empirical analysis of the modified software.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01299389
    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...