Library

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
  • 1
    Electronic Resource
    Electronic Resource
    The node capacitated graph partitioning problem: A computational study (1998)
    Springer
    Mathematical programming 81 (1998), S. 229-256 
    Details
    ISSN: 1436-4646
    Keywords: Branch-and-cut algorithm ; Clustering ; Compiler design ; Equipartitioning ; Finite element method ; Graph partitioning ; Layout of electronic circuits ; Separation heuristics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we consider the problem ofk-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the objective of minimizing the sum of the costs of the edges between the subsets of the partition. Based on a study of valid inequalities, we present a variety of separation heuristics for cycle, cycle with ears, knapsack tree and path-block cycle inequalities among others. The separation heuristics, plus primal heuristics, have been implemented in a branch-and-cut routine using a formulation including variables for the edges with nonzero costs and node partition variables. Results are presented for three classes of problems: equipartitioning problems arising in finite element methods and partitioning problems associated with electronic circuit layout and compiler design. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01581107
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Tagging of genes involved in multidrug resistance in Aspergillus nidulans (2000)
    Springer
    Molecular genetics and genomics 263 (2000), S. 702-711 
    Details
    ISSN: 1617-4623
    Keywords: Key words Drug sensitivity ; Insertional mutagenesis ; Aspergillus nidulans ; Pleiotropic drug resistance ; Restriction enzyme-mediated integration (REMI)
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology
    Notes: Abstract We have used a plasmid containing the Neurospora crassa pyr4 gene to transform an Aspergillus nidulans pyrG89 mutant strain in the presence of BamHI, and isolated multidrug-sensitive mutants among the transformants. Using this approach, we hoped to identify genes whose products are important for drug resistance by analyzing gene disruptions that alter the drug sensitivity of the cell. About 1300 transformants isolated following transformation were screened for sensitivity to drugs or various stress agents with different and/or the same mechanism of action. Seventy-seven of these transformants showed sensitivity to at least one drug, while fourteen transformants showed a complex phenotype of sensitivity to different drugs. The pyr4 marker was shown to be tightly linked to the mutant phenotype in only 36% of the pleiotropic mutants analyzed in sexual crosses. Genetic crosses between our multidrug-sensitive transformants and cycloheximide-sensitive and imazalil-resistant mutants of A nidulans were performed to determine whether mutations were present at the same loci. We have shown that the gene imaD that confers resistance to imazalil may also be involved in cycloheximide and hygromycin sensitivity, since this mutation is allelic to scyB (mutant scy290). In addition, the cross between the transformant R223 and the imazalil-resistant mutant ima535 showed that both mutations are in the same complementation group, suggesting that the gene imaG could also be involved in cycloheximide and itraconazole sensitivity.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s004380051219
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear steiner tree problem (1990)
    Springer
    OR spectrum 12 (1990), S. 109-111 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung In dieser Arbeit beweisen wir eine gemeinsame scharfe worst-case Fehlerschranke für die bekanntesten in der Literatur beschriebenen effizienten Heuristiken zur Lösung des Steiner-Baum-Problems unter rektilinearer Metrik.
    Notes: Summary We derive in this paper a tight worst case upper bound for the performance ratio of the most efficient heuristics known in the literature for the minimum rectilinear Steiner tree problem.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01784988
    Library Location Call Number Volume/Issue/Year 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...