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  (19,802)
  • 1970-1974  (19,802)
  • Computer Science  (19,802)
Collection
  • Articles  (19,802)
Source
Keywords
Publisher
Years
Year
Journal
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Some recent results inn-person game theory (1971)
    Springer
    Mathematical programming 1 (1971), S. 58-67 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The discussion will center mainly on some work on two solution concepts: the core for gaines without side payments and the nucleolus for games with side payments (characteristic funtion games). The core has become an important equilibrium concept in mathematical economics. The nucleolus is related to the theory of bargaining sets.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584072
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Publications (1971)
    Springer
    Mathematical programming 1 (1971), S. 117-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/BF01584078
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    The Mathematical Programming Society (1971)
    Springer
    Mathematical programming 1 (1971), S. 123-125 
    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/BF01584080
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Hybrid programs: Linear and least-distance (1971)
    Springer
    Mathematical programming 1 (1971), S. 153-167 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We consider a quadratic program equivalent to the general problem of minimizing a convex quadratic function of many variables subject to linear inequality constraints. In previous work [12], one of us presented an algorithm related to such problems, and classified them under “combinatorial equivalence”. The classification contained linear programs at one end (where the function has zero quadratic part) and least-distance programs at the other. A least-distance program is a problem of finding a point of a convex polyhedron which is at least distance from a given point; such programs have been studied by one of us [15, 17] and were shown to correspond to that case of the general problem where the function has positive definite quadratic part. We now extend the work on least-distance programs to those programs intermediate between linear and least-distance (called “essentially bisymmetric” in [12]), and show that such programs are really “hybrids”, with traits inherited from both parent programs: linear and leastdistance.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584084
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    An “out-of-kilter” algorithm for solving minimum cost potential problems (1971)
    Springer
    Mathematical programming 1 (1971), S. 275-290 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract An algorithm is given for solving the optimum potential problem, which is the dual of the classical “out-of-kilter” algorithm for flow problems. Moreover, a new proof of finiteness is provided, which holds even for non-rational data; it applies to all the algorithms of network theory which include a labeling process.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584092
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Publications (1972)
    Springer
    Mathematical programming 2 (1972), S. 130-132 
    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/BF01584539
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    An algorithm for solving linearly constrained optimization problems (1972)
    Springer
    Mathematical programming 2 (1972), S. 133-165 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract An algorithm for minimization of functions of many variables, subject possibly to linear constraints on the variables, is described. In it a subproblem is solved in which a quadratic approximation is made to the object function and minimized over a region in which the approximation is valid. A strategy for deciding when this region should be expanded or contracted is given. The quadratic approximation involves estimating the hessian of the object function by a matrix which is updated at each iteration by a formula recently reported by Powell [6]. This formula enables convergence of the algorithm from any feasible point to be proved. Use of such an approximation, as against using exact second derivatives, also enables a reduction of about 60% to be made in the number of operations to solve the subproblem. Numerical evidence is reported showing that the algorithm is efficient in the number of function evaluations required to solve well known test problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584540
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Maximal domains of quasi-convexity and pseudo-convexity for quadratic functions (1972)
    Springer
    Mathematical programming 3 (1972), S. 178-192 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We study quasi-convex and pseudo-convex quadratic functions on solid convex sets. This generalizes Martos' results in [12] and [13] by using Koecher's results in [8].
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584988
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    A partitioning algorithm for the multicommodity network flow problem (1972)
    Springer
    Mathematical programming 3 (1972), S. 157-177 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A partitioning algorithm for solving the general minimum cost multicommodity flow problem for directed graphs is presented in the framework of a network flow method and the dual simplex method. A working basis which is considerably smaller than the number of capacitated arcs in the given network is employed and a set of simple secondary constraints is periodically examined. Some computational aspects and preliminary experimental results are discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584987
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Editorial policy (1972)
    Springer
    Mathematical programming 3 (1972), S. 396-396 
    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/BF01585012
    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...