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
    Springer
    Annals of operations research 86 (1999), S. 507-526 
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract We investigate the problems of minimizing the maximum absolute lateness and range oflateness under generalized due dates on a single machine. In contrast to the traditional duedate cases, we show that these problems are unary NP‐hard. Furthermore, we present simpleapproximation algorithms for these problems, and show that they achieve the performanceratios of n for the problem of minimizing the maximum absolute lateness and of [ n/2 ] forthe problem of minimizing the range of lateness, where [ x ] is the smallest integer no lessthan x.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical methods of operations research 30 (1986), S. A155 
    ISSN: 1432-5217
    Keywords: Scheduling ; Schur-convexity ; rearrangement inqualities
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Diese Note behandelt das Problem, die Spaltenelemente einer reellen Matrix so zu permutieren, daß eine reellwertige Funktion der Zeilensummen minimiert wird. Der Spezialfall der Minimierung der maximalen Zeilensumme wurde jüngst von mehreren Autoren [1, 4, 6, 7] untersucht. Hier betrachten wir primär den Fall, daß die Matrix nur zwei Spalten hat und die Zielfunktion Schur-konvex ist.
    Notes: Abstract This note deals with the problem of permuting elements within columns of a real matrix so as to minimize a real-valued function of row sums. The special case dealing with minimization of maximum row sum has been studied by several authors [1, 4, 6, 7] recently. Here we are concerned primarily with the case in which the matrix has two columns only and the function is Schur-convex.
    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 methods of operations research 31 (1987), S. A69 
    ISSN: 1432-5217
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    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 methods of operations research 25 (1981), S. 15-23 
    ISSN: 1432-5217
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Kürzlich wurden neuartige Tangentialkegel von Clarke, Hiriart-Urruty und Rockafellar eingeführt. Es erweist sich, daß diese neuen Approximationen, im Gegensatz zu den klassischen Tangentialkegeln, nicht notwendig isoton bezüglich Inklusion sind. Die vorliegende Arbeit gefaßt sich mit Modifikationen dieser Begriffe, die zu isotonen Approximationen führen. Der Begriff eines Approximationsoperators wird eingeführt, und es wird ein allgemeines Schema zur Erzeugung isotoner Approximationen in reellen affinen Räumen vorgestellt. Die Verwendung isotoner Approximationen in der Optimierung wird zusammenfassend dargestellt.
    Notes: Abstract Recently, new types of tangential cones such as the radial tangent cone, the hypertangent cone, the Clarke's tangent cone, and the set of directions in which a set is epi-Lipschitzian at a point have been introduced by Clarke, Hiriart-Urruty, and Rockafellar. It turns out that in contrast to the classical tangential cones these new approximations are not necessarily isotone with respect to set inclusion. The present paper is concerned with modifications of the above-mentioned concepts that lead to isotone approximation. A concept of an approximation operator is introduced and a general scheme for construction of isotone approximations in real affine spaces is presented along with a survey of isotone approximations employed in optimization.
    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
    Journal of optimization theory and applications 21 (1977), S. 39-49 
    ISSN: 1573-2878
    Keywords: Optimal control ; augmented penalty function ; terminal constraints ; gradient methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This note presents an extension of the Miele—Cragg-Iyer-Levy augmented function method for finite-dimensional optimization problems to optimal control problems. A numerical study is provided.
    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...