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  (6,644)
  • Articles: DFG German National Licenses  (6,644)
  • Springer  (6,644)
  • 2020-2024
  • 1985-1989
  • 1975-1979  (6,644)
  • 1978  (6,644)
  • Physics  (6,172)
  • Computer Science  (574)
Collection
  • Articles  (6,644)
Source
Keywords
Publisher
Years
  • 2020-2024
  • 1985-1989
  • 1975-1979  (6,644)
Year
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Progressive global random search of continuous functions (1978)
    Springer
    Mathematical programming 15 (1978), S. 330-342 
    Details
    ISSN: 1436-4646
    Keywords: Global Optimization ; Random Search ; Convergence ; Sequential Minimization ; Lipschitz Functions ; Stochastic Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A sequential random search method for the global minimization of a continuous function is proposed. The algorithm gradually concentrates the random search effort on areas neighboring the global minima. A modification is included for the case that the function cannot be exactly evaluated. The global convergence and the asymptotical optimality of the sequential sampling procedure are proved for both the stochastic and deterministic optimization problem.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609037
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Tenth International Symposium on Mathematical Programming (1978)
    Springer
    Mathematical programming 15 (1978), S. 364-364 
    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/BF01609044
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Least distance methods for the scheme of polytopes (1978)
    Springer
    Mathematical programming 15 (1978), S. 1-11 
    Details
    ISSN: 1436-4646
    Keywords: APL-Codes ; Polytope ; Point Set ; Vertices ; Faces ; Facets ; Quadratic Programming ; Distance ; Decomposition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Methods are described and APL-codes are supplied to find vertices, edges, other faces and facets of polytopes given by point sets. The basic subroutine is a simplicial decomposition version of least distance, i.e. quadratic, programming. Computational experience indicates high efficiency.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01608995
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Editorial policy (1978)
    Springer
    Mathematical programming 14 (1978), S. 127-127 
    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/BF01588960
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Algorithms for nonlinear constraints that use lagrangian functions (1978)
    Springer
    Mathematical programming 14 (1978), S. 224-248 
    Details
    ISSN: 1436-4646
    Keywords: Augmented Lagrangian ; Lagrangian Function ; Nonlinear Constraints ; Nonlinear Programming ; Optimization Algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Lagrangian functions are the basis of many of the more successful methods for nonlinear constraints in optimization calculations. Sometimes they are used in conjunction with linear approximations to the constraints and sometimes penalty terms are included to allow the use of algorithms for unconstrained optimization. Much has been discovered about these techniques during the last eight years and this paper gives a view of the progress and understanding that has been achieved and its relevance to practical algorithms. A particular method is recommended that seems to be more powerful than the author believed to be possible at the beginning of 1976.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588967
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    The Mathematical Programming Society (1978)
    Springer
    Mathematical programming 14 (1978), S. 262-262 
    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/BF01588969
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    The reformulation of two mixed integer programming problems (1978)
    Springer
    Mathematical programming 14 (1978), S. 325-331 
    Details
    ISSN: 1436-4646
    Keywords: Integer Programming ; Formulation ; Models
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Two practical problems are described, each of which can be formulated in more than one way as a mixed integer programming problem. The computational experience with two formulations of each problem is given. It is pointed out how in each case a reformulation results in the associated linear programming problem being more constrained. As a result the reformulated mixed integer problem is easier to solve. The problems are a multi-period blending problem and a mining investment problem.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588974
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Numerically stable methods for quadratic programming (1978)
    Springer
    Mathematical programming 14 (1978), S. 349-372 
    Details
    ISSN: 1436-4646
    Keywords: Indefinite Quadratic Programming ; Matrix Factorizations ; Numerical Software
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Numerically stable algorithms for quadratic programming are discussed. A new algorithm is described for indefinite quadratic programming which utilizes methods for updating positivedefinite factorizations only. Consequently all the updating procedures required are common to algorithms for linearly-constrained optimization. The new algorithm can be used for the positive-definite case without loss of efficiency.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588976
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    A mathematical programming system for preference and compatibility maximized menu planning and scheduling (1978)
    Springer
    Mathematical programming 15 (1978), S. 63-76 
    Details
    ISSN: 1436-4646
    Keywords: Menu Planning ; Separation Scheduling ; Menu Scheduling ; Decomposition ; Non-linear Programming ; Binary Knapsack Problem ; Lagrangian Relaxation ; Transportation Problem ; Branch and Bound
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper, the analytical representation of food preference is used in a separable non-linear program to yield the serving frequencies of menu items for a finite time horizon. The frequencies obtained in this way insure cost and nutritional control. Subsequently, the scheduling problem dealing with item assignments to meals and days is formulated as an integer program consisting of several transportation problems linked by weekly nutritional constraints. This problem is solved using a branch and bound algorithm which employs Lagrangian relaxation to obtain bounds and to decide on branching strategy.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609000
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    On equivalent representations of certain multicommodity networks as single commodity flow problems (1978)
    Springer
    Mathematical programming 15 (1978), S. 92-99 
    Details
    ISSN: 1436-4646
    Keywords: Network Flows ; Multicommodity Networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Several classes of multicommodity networks have been shown to have the property that they can be transformed to equivalent uncapacitated single commodity flow problems. We show that many of these networks can be further reduced to smaller, semi-capacitated flow problems using the inverse of a result of Ford and Fulkerson. This appears to be a useful computationally-oriented tool for developing practically efficient algorithms. These concepts are also used to establish a generalization of a previous result concerning multicommodity transportation problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609003
    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...