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  (82,827)
  • Springer  (35,594)
  • Springer Nature  (23,168)
  • Wiley  (17,332)
  • American Association for the Advancement of Science (AAAS)  (6,733)
  • American Physical Society (APS)
  • 2010-2014  (54,778)
  • 2005-2009
  • 2000-2004  (14,530)
  • 1995-1999
  • 1985-1989  (13,519)
  • 1980-1984
  • 1960-1964
  • 1955-1959
  • 1935-1939
  • 1930-1934
  • 2013  (54,778)
  • 2002  (14,530)
  • 1986  (13,519)
  • Geosciences  (42,321)
  • Natural Sciences in General  (33,069)
  • Computer Science  (13,642)
  • Information Science and Librarianship  (1,071)
Collection
  • Articles  (82,827)
Source
Keywords
Publisher
Years
  • 2010-2014  (54,778)
  • 2005-2009
  • 2000-2004  (14,530)
  • 1995-1999
  • 1985-1989  (13,519)
    • +
Year
Journal
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Some comments on Wolfe's ‘away step’ (1986)
    Springer
    Mathematical programming 35 (1986), S. 110-119 
    Details
    ISSN: 1436-4646
    Keywords: Convex programming ; Frank-Wolfe algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We give a detailed proof, under slightly weaker conditions on the objective function, that a modified Frank-Wolfe algorithm based on Wolfe's ‘away step’ strategy can achieve geometric convergence, provided a strict complementarity assumption holds.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01589445
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Announcement: Euro VIII - the eighth European conference on operational research (1986)
    Springer
    Mathematical programming 35 (1986), S. 125-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/BF01589448
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm (1986)
    Springer
    Mathematical programming 35 (1986), S. 140-172 
    Details
    ISSN: 1436-4646
    Keywords: Probabilistic analysis ; self-dual simplex ; spherical symmetry
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we analyze the average number of steps performed by the self-dual simplex algorithm for linear programming, under the probabilistic model of spherical symmetry. The model was proposed by Smale. Consider a problem ofn variables withm constraints. Smale established that for every number of constraintsm, there is a constantc(m) such that the number of pivot steps of the self-dual algorithm,ρ(m, n), is less thanc(m)(lnn) m(m+1) . We improve upon this estimate by showing thatρ(m, n) is bounded by a function ofm only. The symmetry of the function inm andn implies thatρ(m, n) is in fact bounded by a function of the smaller ofm andn.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01580645
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    A finite characterization ofK-matrices in dimensions less than four (1986)
    Springer
    Mathematical programming 35 (1986), S. 17-31 
    Details
    ISSN: 1436-4646
    Keywords: Linear complementarity problem ; K-matrix ; Q 0-matrix ; finite characterization ; Q-matrix
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The class of realn × n matricesM, known asK-matrices, for which the linear complementarity problemw − Mz = q, w ≥ 0, z ≥ 0, w T z =0 has a solution wheneverw − Mz =q, w ≥ 0, z ≥ 0 has a solution is characterized for dimensionsn 〈4. The characterization is finite and ‘practical’. Several necessary conditions, sufficient conditions, and counterexamples pertaining toK-matrices are also given. A finite characterization of completelyK-matrices (K-matrices all of whose principal submatrices are alsoK-matrices) is proved for dimensions 〈4.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01589438
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Binary group and Chinese postman polyhedra (1986)
    Springer
    Mathematical programming 34 (1986), S. 1-33 
    Details
    ISSN: 1436-4646
    Keywords: Polyhedra ; Chinese Postman ; Binary Group Problems ; Binary Matroids ; Blocking Clutters
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A new proof of the characterization of the Chinese postman polyhedra is given. In developing this proof, a theorem of Gomory about homomorphic lifting of facets for group polyhedra is generalized to subproblems. Some results for the Chinese postman problem are generalized to binary group problems. In addition, a connection is made between Fulkerson's blocking polyhedra and a blocking pair of binary group problems. A connection is also developed between minors and lifting of facets for group problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01582160
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    On box totally dual integral polyhedra (1986)
    Springer
    Mathematical programming 34 (1986), S. 48-61 
    Details
    ISSN: 1436-4646
    Keywords: Total Dual Integrality ; Hilbert Basis ; Polyhedra
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Edmonds and Giles introduced the class of box totally dual integral polyhedra as a generalization of submodular flow polyhedra. In this paper a geometric characterization of these polyhedra is given. This geometric result is used to show that each TDI defining system for a box TDI polyhedron is in fact a box TDI system, that the class of box TDI polyhedra is in co-NP and is closed under taking projections and dominants, that the class of box perfect graphs is in co-NP, and a result of Edmonds and Giles which is related to the facets of box TDI polyhdera.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01582162
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Facet inequalities from simple disjunctions in cutting plane theory (1986)
    Springer
    Mathematical programming 34 (1986), S. 72-83 
    Details
    ISSN: 1436-4646
    Keywords: Cutting Planes ; Disjunctive Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The duality between facets of the convex hull of disjunctive sets and the extreme points of reverse polars of these sets is utilized to establish simple rules for the derivation of all facet cuts for simple disjunctions, namely, elementary disjunctions in nonnegative variables. These rules generalize the cut generation procedure underlying polyhedral convexity cuts with negative edge extensions. The latter are also shown to possess some interesting properties with respect to a biextremal problem that maximizes the distance, from the origin, of the nearest point feasible to the cut. A computationally inexpensive procedure is given to generate facet cuts for simple disjunctions which are dominant with respect to any specified preemptive ordering of variables.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01582164
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Convergence of an annealing algorithm (1986)
    Springer
    Mathematical programming 34 (1986), S. 111-124 
    Details
    ISSN: 1436-4646
    Keywords: Global Optimization ; Stochastic Optimization ; Annealing ; Metropolis Method ; NP ; Hill Climbing ; Local Improvement
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The annealing algorithm is a stochastic optimization method which has attracted attention because of its success with certain difficult problems, including NP-hard combinatorial problems such as the travelling salesman, Steiner trees and others. There is an appealing physical analogy for its operation, but a more formal model seems desirable. In this paper we present such a model and prove that the algorithm converges with probability arbitrarily close to 1. We also show that there are cases where convergence takes exponentially long—that is, it is no better than a deterministic method. We study how the convergence rate is affected by the form of the problem. Finally we describe a version of the algorithm that terminates in polynomial time and allows a good deal of ‘practical’ confidence in the solution.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01582166
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    A competitive (dual) simplex method for the assignment problem (1986)
    Springer
    Mathematical programming 34 (1986), S. 125-141 
    Details
    ISSN: 1436-4646
    Keywords: Assignment Problem ; Dual Method ; Signature ; Linear Programming ; Simplex Method ; Pivoting ; Average Behavior
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract “Where there is abundance of mystery and confusion in every direction, the truth seldom remains hidden for long. It's a matter of having plenty of angles to go at it from. Only the utterly simple crimes - the simplex crimes, you may say - have the trick of remaining baffling.” - Sir John (from Michael Innes,The Open House (A Sir John Appleby Mystery), Penguin Books, 1974). A dual simplex method for the assignment problem leaves open to choice the activity (i,j) of rowi and columnj that is to be dropped in pivoting so long asx ij 〈 0. A choice (i,j) over columnsj having at least 3 basic activities that minimizesx ij is shown to converge in at most ( 2 n-1 ) pivots, and at most O(n 3) time, and it is argued that on average the number of pivots is at mostn logn.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01580579
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Network design problem with congestion effects: A case of bilevel programming (1986)
    Springer
    Mathematical programming 34 (1986), S. 142-162 
    Details
    ISSN: 1436-4646
    Keywords: Network Design ; Bilevel Programming ; Variational Inequalities ; Stackelberg Games
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Recently much attention has been focused on multilevel programming, a branch of mathematical programming that can be viewed either as a generalization of min-max problems or as a particular class of Stackelberg games with continuous variables. The network design problem with continuous decision variables representing link capacities can be cast into such a framework. We first give a formal description of the problem and then develop various suboptimal procedures to solve it. Worst-case behaviour results concerning the heuristics, as well as numerical results on a small network, are presented.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01580580
    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...