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
  • assignment  (2)
  • Mesoscale patterns  (1)
  • Springer  (3)
  • American Society of Hematology
  • 1
    Electronic Resource
    Electronic Resource
    Approaches for Generating Mesoscale Patterns of Semiconductor Nanoclusters (1997)
    Springer
    Journal of cluster science 8 (1997), S. 159-178 
    Details
    ISSN: 1572-8862
    Keywords: Mesoscale patterns ; cadmium selenide
    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 review, existing approaches for the manipulation and/or construction of isolated semiconductor nanoclusters into deliberate, patterned arrays are described. Diverse examples of different strategies from solid state, solution, and hybrid combinations are described as well as successes achieved to date. The approaches to be discussed include conventional solid state lithography, volumetric constriction of monodisperse nanoclusters deposited from solution, and the use of anchored macromolecular templates to direct semiconductor nanocluster assembly.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1022679923799
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    The singly constrained assignment problem: An AP basis algorithm (1995)
    Springer
    Computational optimization and applications 4 (1995), S. 347-374 
    Details
    ISSN: 1573-2894
    Keywords: mathematical programming ; assignment ; networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This manuscript presents a specialized primal simplex algorithm to obtain near optimal integer solutions for the singly constrained assignment problem. An optimal solution for the continuous relaxation of the problem is obtained by generalizing the alternating basis algorithm of Barr, Glover, and Klingman for the pure assignment problem. Near optimal integer solutions are obtained by pivoting into the optimal basis the slack variable associated with the side constraint. Our empirical analysis indicated that for our test problems the soft-ware implementation of this algorithm was six times faster than CPLEX and four times faster than NETSIDE (a specialized code for network problems with side constraints). The integer solutions obtained in our tests were typically within 2% of the optimum of the continuous relaxation.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01300862
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    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...