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
  • Articles  (10,908)
  • Springer  (8,392)
  • Institute of Electrical and Electronics Engineers (IEEE)  (2,516)
  • American Chemical Society
  • American Chemical Society (ACS)
  • American Geophysical Union
  • National Academy of Sciences
  • 2015-2019  (8,498)
  • 2005-2009  (1,785)
  • 1990-1994
  • 1980-1984  (625)
  • 2018  (3,460)
  • 2017  (5,038)
  • 2009  (1,785)
  • 1981  (625)
  • Computer Science  (10,908)
Collection
  • Articles  (10,908)
Source
Keywords
Publisher
Years
  • 2015-2019  (8,498)
  • 2005-2009  (1,785)
  • 1990-1994
  • 1980-1984  (625)
Year
Journal
Topic
  • 1
    Electronic Resource
    Electronic Resource
    On the number of solutions to a class of complementarity problems (1981)
    Springer
    Mathematical programming 21 (1981), S. 190-203 
    Details
    ISSN: 1436-4646
    Keywords: Complementarity Problem ; Cones ; Topological Degree
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we consider the problem of establishing the number of solutions to the complementarity problem. For the case when the Jacobian of the mapping has all principal minors negative, and satisfies a condition at infinity, we prove that the problem has either 0, 1, 2 or 3 solutions. We also show that when the Jacobian has all principal minors positive, and satisfies a condition at infinity, the problem has a unique solution.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584240
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Finding simplicial subdivisions of polytopes (1981)
    Springer
    Mathematical programming 21 (1981), S. 233-234 
    Details
    ISSN: 1436-4646
    Keywords: Polytope ; Subdivision ; Simplex ; Volume ; Centroid
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Subdivisions of polytopes are described which place any chosen vertex in a (near-) minimal number of simplices. Ancillary procedures to find volumes and centroids of polytopes are indicated.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584244
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Direct theorems in semi-infinite convex programming (1981)
    Springer
    Mathematical programming 21 (1981), S. 301-318 
    Details
    ISSN: 1436-4646
    Keywords: Semi-infinite Programs ; Open Helly-type Theorems ; Finite Subprograms ; Convex Programs ; Multi-criteria Programs ; Quasi-convex Programs ; Quasi-differentiable Programs
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We show that a semi-infinite quasi-convex program with certain regularity conditions possesses finitely constrained subprograms with the same optimal value. This result is applied to various problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584251
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    A statistical estimate of the structure of multi-extremal problems (1981)
    Springer
    Mathematical programming 21 (1981), S. 348-356 
    Details
    ISSN: 1436-4646
    Keywords: Multi-extremal Optimization ; Multinomial Distribution ; Bayes Estimate ; Monte Carlo
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The solution of ak-extremal problem is defined as the set of pairs (x i * , θi),i = 1, ⋯ ,k, where x t * isi th local minimum andθ i is the volume of the set of attraction of this minimum. A Bayesian estimate ofk and (θ 1 , ⋯ , θ k ) is constructed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584254
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Symposium on network flows (1981)
    Springer
    Mathematical programming 21 (1981), S. 120-120 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584234
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    On solving a primal geometric program by partial dual optimization (1981)
    Springer
    Mathematical programming 21 (1981), S. 319-330 
    Details
    ISSN: 1436-4646
    Keywords: Nonlinear Programming ; Geometric Programming ; Duality Theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The several published methods for mapping a dual solution estimate to a primal solution estimate in posynomial geometric programming provide no criteria for deciding how much deviation from primal feasibility, or discrepancy between the primal and dual objective function values, should be permitted before the primal solution estimate is accepted by the designer. This paper presents a new and simple dual-to-primal conversion method that uses the cost coefficients to provide a sound economic criterion for determining when to accept a primal solution estimate. The primal solution estimate generated is the exact solution to a modified primal obtained from the given primal by modifying the cost coefficients, with the exponent matrix left unchanged. The method is shown to have desirable properties when coupled with a convergent dual algorithm.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584252
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Minimum cost spanning tree games (1981)
    Springer
    Mathematical programming 21 (1981), S. 1-18 
    Details
    ISSN: 1436-4646
    Keywords: Game Theory ; Cost Allocation ; Spanning Tree
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We consider the problem of cost allocation among users of a minimum cost spanning tree network. It is formulated as a cooperative game in characteristic function form, referred to as a minimum cost spanning tree (m.c.s.t.) game. We show that the core of a m.c.s.t. game is never empty. In fact, a point in the core can be read directly from any minimum cost spanning tree graph associated with the problem. For m.c.s.t. games with efficient coalition structures we define and construct m.c.s.t. games on the components of the structure. We show that the core and the nucleolus of the original game are the cartesian products of the cores and the nucleoli, respectively, of the induced games on the components of the efficient coalition structure.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584227
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Institute on deterministic and stochastic scheduling (1981)
    Springer
    Mathematical programming 21 (1981), S. 119-119 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584233
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Polynomial algorithms for a class of linear programs (1981)
    Springer
    Mathematical programming 21 (1981), S. 121-136 
    Details
    ISSN: 1436-4646
    Keywords: Linear Programming ; Polynomial Algorithms ; Total Unimodularity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper describes several algorithms for solution of linear programs. The algorithms are polynomial when the problem data satisfy certain conditions.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584235
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    An algorithm for computing equilibria in a linear monetary economy (1981)
    Springer
    Mathematical programming 21 (1981), S. 182-189 
    Details
    ISSN: 1436-4646
    Keywords: Equilibrium ; Linear Monetary Economy ; Linear Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract An algorithm is presented for computing equilibria in a linear monetary economy, that is, an exchange economy in which all individuals have linear utility functions and in which goods are bought and sold only in exchange for money. The algorithm computes the equilibrium prices by solving a finite sequence of linear programming problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584239
    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...