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
    Woodbury, NY : American Institute of Physics (AIP)
    Applied Physics Letters 56 (1990), S. 1905-1907 
    ISSN: 1077-3118
    Source: AIP Digital Archive
    Topics: Physics
    Notes: Superconducting YBaCuO (1-2-3) thin films have been deposited on GaAs by laser ablation, in the presence of an oxygen plasma, at a substrate temperature of 600 °C. The (100) GaAs had a thin (100 A(ring)) Al0.3Ga0.7As cap layer, in order to prevent decomposition of the GaAs. The as-deposited YBaCuO film had a Tc (onset) of 80 K and a Tc (zero) of 20 K. Transmission electron microscopy studies showed the presence of voids in the GaAs, ∼1000 A(ring) in length, and extending 500 A(ring) into the GaAs.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Woodbury, NY : American Institute of Physics (AIP)
    Applied Physics Letters 56 (1990), S. 490-492 
    ISSN: 1077-3118
    Source: AIP Digital Archive
    Topics: Physics
    Notes: Results of growth of InAs on a superconducting TlCaBaCuO (2-1-2-2) thin film are reported. The InAs was grown by molecular beam migration-enhanced epitaxy at a substrate temperature of 250 °C. The Tc(zero) of the Tl film before and after InAs deposition was 106 and 100 K, respectively. X-ray diffraction and reflection electron microscopy studies showed the InAs to be polycrystalline, having grains in the 300 A(ring) size range. This is the first report of deposition of a III-V semiconductor on superconductor, without significant degradation of Tc.
    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
    Mathematical programming 59 (1993), S. 87-115 
    ISSN: 1436-4646
    Keywords: Graph partition ; multiway cut ; polytope ; facet
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we describe several forms of thek-partition problem and give integer programming formulations of each case. The dimension of the associated polytopes and some basic facets are identified. We also give several valid and facet defining inequalities for each of the polytopes.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 64 (1994), S. 231-246 
    ISSN: 1436-4646
    Keywords: Steiner tree ; Polyhedron ; Facets
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This is the second part of two papers addressing the study of the facial structure of the Steiner tree polyhedron. In this paper we identify several classes of facet defining inequalities and relate them to special classes of graphs on which the Steiner tree problem is known to be NP-hard.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 55 (1992), S. 35-47 
    ISSN: 1436-4646
    Keywords: Perfect matrices ; balanced matrices
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we define wheel matrices and characterize some properties of matrices that are perfect but not balanced. A consequence of our results is that if a matrixA is perfect then we can construct a polynomial number of submatricesA I,⋯,A n ofA such thatA is balanced if and only if all the submatricesA 1,⋯,A n ofA are perfect. This implies that if the problem of testing perfection is polynomially solvable, then so is the problem of testing balancedness.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 55 (1992), S. 129-168 
    ISSN: 1436-4646
    Keywords: Polyhedral combinatorics ; integrality of polytopes ; decomposition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Claude Berge defines a (0, 1) matrix A to be linear ifA does not contain a 2 × 2 submatrix of all ones.A(0, 1) matrixA is balanced ifA does not contain a square submatrix of odd order with two ones per row and column. The contraction of a rowi of a matrix consists of the removal of rowi and all the columns that have a 1 in the entry corresponding to rowi. In this paper we show that if a linear balanced matrixA does not belong to a subclass of totally unimodular matrices, thenA orA T contains a rowi such that the submatrix obtained by contracting rowi has a block-diagonal structure.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 64 (1994), S. 209-229 
    ISSN: 1436-4646
    Keywords: Steiner tree ; Polyhedron ; Facets ; Projection
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we give some integer programming formulations for the Steiner tree problem on undirected and directed graphs and study the associated polyhedra. We give some families of facets for the undirected case along with some compositions and extensions. We also give a projection that relates the Steiner tree polyhedron on an undirected graph to the polyhedron for the corresponding directed graph. This is used to show that the LP-relaxation of the directed formulation is superior to the LP-relaxation of the undirected one.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Bulletin of environmental contamination and toxicology 52 (1994), S. 905-911 
    ISSN: 1432-0800
    Source: Springer Online Journal Archives 1860-2000
    Topics: Energy, Environment Protection, Nuclear Power Engineering , Medicine
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 46 (1990), S. 53-60 
    ISSN: 1436-4646
    Keywords: Generalized assignment problem ; knapsack problem ; special ordered sets ; integer polytope ; facets ; (1,k)-configurations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract class of facet defining inequalities for the generalized assignment problem is derived. These inequalities are based upon multiple knapsack constraints and are derived from (1,k)-configuration inequalities.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 46 (1990), S. 31-52 
    ISSN: 1436-4646
    Keywords: Generalized assignment problem ; knapsack problem ; special ordered sets ; integer polytope ; facets
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Three classes of valid inequalities based upon multiple knapsack constraints are derived for the generalized assignment problem. General properties of the facet defining inequalities are discussed and, for a special case, the convex hull is completely characterized. In addition, we prove that a basic fractional solution to the linear programming relaxation can be eliminated by a facet defining inequality associated with an individual knapsack constraint.
    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...