Library

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
  • 1
    Electronic Resource
    Electronic Resource
    Proper and Unit Trapezoid Orders and Graphs (1998)
    Springer
    Order 15 (1998), S. 325-340 
    Details
    ISSN: 1572-9273
    Keywords: dimension ; interval ; order ; trapezoid
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We show that the class of trapezoid orders in which no trapezoid strictly contains any other trapezoid strictly contains the class of trapezoid orders in which every trapezoid can be drawn with unit area. This is different from the case of interval orders, where the class of proper interval orders is exactly the same as the class of unit interval orders.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1006042122315
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Note: Semi-Order Dimension Two is a Comparability Invariant (1998)
    Springer
    Order 15 (1998), S. 385-390 
    Details
    ISSN: 1572-9273
    Keywords: comparability invariance ; dimension ; partially ordered sets
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A partial order P =(X, 〈 P ) is a semi-order if it is an interval order admitting an interval representation such that all the intervals are of unit length. The semi-order dimension of P is the smallest k for which there exist k semi-order extensions of P which realize P. In 1992 the question whether semi-order dimension is a comparability invariant was posed. We prove that for k = 2 this is the case.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1006223715426
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Treewidth of cocomparability graphs and a new order-theoretic parameter (1994)
    Springer
    Order 11 (1994), S. 47-60 
    Details
    ISSN: 1572-9273
    Keywords: 06A06 ; Treewidth ; pathwidth ; dimension ; interval dimension ; cocomparability graphs ; approximation algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We show that the pathwidth of a cocomparability graphG equals its treewidth. The proof is based on a new notion, calledinterval width, for a partial orderP, which is the smallest width of an interval order contained inP, and which is shown to be equal to the treewidth of its cocomparability graph. We observe also that determining any of these parameters isNP-hard and we establish some connections between classical dimension notions of partial orders and interval width. In fact we develop approximation algorithms for interval width ofP whose performance ratios depend on the dimension and interval dimension ofP, respectively.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01462229
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Algorithmic graph theory and perfect graphs (1986)
    Springer
    Order 3 (1986), S. 207-208 
    Details
    ISSN: 1572-9273
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00390110
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Computing the bump number is easy (1988)
    Springer
    Order 5 (1988), S. 107-129 
    Details
    ISSN: 1572-9273
    Keywords: 06A10 partial order ; 68C25 computational complexity and efficiency of algorithms ; 68E10 graph theory ; 90C08 special problems of linear programming ; Bump number ; jump number ; polynomial algorithm ; linear extension ; bump-critical ; min-max theorem ; extension lattice ; linear circuit layout
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The bump number b(P) of a partial order P is the minimum number of comparable adjacent pairs in some linear extension of P. It has an interesting application in the context of linear circuit layout problems. Its determination is equivalent to maximizing the number of jumps in some linear extension of P, for which the corresponding minimization problem (the jump number problem) is known to be NP-hard. We derive a polynomial algorithm for determining b(P). The proof of its correctness is based on a min-max theorem involving simple-structured series-parallel partial orders contained in P. This approach also leads to a characterization of all minimal partial orders (with respect to inclusion of the order relations) with fixed bump number.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00337617
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Advanced DSS for scheduling: software engineering aspects and the role of Eigenmodels (1995)
    Springer
    Annals of operations research 55 (1995), S. 453-469 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper describes an advanced decision support system for scheduling that is based on both, extensive knowledge about scheduling algorithms, and a new software engineering paradigm developed by the FAW. This paradigm uses an elaborate compromise between object-orientation, constraint processing, and functional capabilities, and supports distributed computing. The system has the capability to generate a model of itself. ThisEigenmodel is a directed graphG representing data structures (nodes ofG) and algorithms (edges ofG). The methods developed for scheduling problems can, on a “higher” level of abstraction, also be applied to the Eigenmodel itself. This can then be used for performance analysis andlearning aspects which will eventually provide the user with valuable information about the functioning and performance of the system, thus contributing to the envisioned new generation of decision support systems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02032384
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Linear preselective policies for stochastic project scheduling (2000)
    Springer
    Mathematical methods of operations research 52 (2000), S. 501-515 
    Details
    ISSN: 1432-5217
    Keywords: Key words: Resource-constrained project scheduling – random processing times – scheduling policies –and/or precedence constraints
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract. In the context of stochastic resource-constrained project scheduling we introduce a novel class of scheduling policies, the linear preselective policies. They combine the benefits of preselective policies and priority policies; two classes that are well known from both deterministic and stochastic scheduling. We study several properties of this new class of policies which indicate its usefulness for computational purposes. Based on a new representation of preselective policies as and/or precedence constraints we derive efficient algorithms for computing earliest job start times and state a necessary and sufficient dominance criterion for preselective policies.  A computational experiment based on 480 instances empirically validates the theoretical findings.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s001860000095
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Book reviews (1986)
    Springer
    Mathematical methods of operations research 30 (1986), S. A154 
    Details
    ISSN: 1432-5217
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01919176
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Book
    Book
    Algorithms : 10th annual European symposium ; proceedings; 2461 (2002)
    Berlin u.a. :Springer,
    Details
    Title: Algorithms : 10th annual European symposium ; proceedings; 2461
    Author: ESA 〈10, 2002, Rome〉
    Contributer: Möhring, Rolf , Raman, Rajeev
    Publisher: Berlin u.a. :Springer,
    Year of publication: 2002
    Series Statement: Lecture notes in computer science 2461
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    ZIB Catalog
    Zuse Institute Berlin get availability status
  • 10
    facet.materialart.
    Unknown
    A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling (2010)
    Details
    Publication Date: 2022-03-14
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...