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
    On representing sylvester-gallai designs (1989)
    Springer
    Discrete & computational geometry 4 (1989), S. 345-348 
    Details
    ISSN: 1432-0444
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A misstated conjecture in [3] leads to an interesting “(1, 3) representation” of the 7-point projective plane inR 4 where points are represented by lines and planes by 3-spaces. The corrected form of the original conjecture will be negated if there is a (1, 3) representation of the 13-point projective plane inR 4 but that matter is not settled.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02187735
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    The existence of non-trivial hyperfactorizations ofK 2n (1991)
    Springer
    Combinatorica 11 (1991), S. 9-15 
    Details
    ISSN: 1439-6912
    Keywords: 05 B 30 (primary) ; 05 C 99 (secondary)
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A λ-hyperfactorization ofK 2n is a collection of 1-factors ofK 2n for which each pair of disjoint edges appears in precisely λ of the 1-factors. We call a λ-hyperfactorizationtrivial if it contains each 1-factor ofK 2n with the same multiplicity γ (then λ=γ(2n−5)!!). A λ-hyperfactorization is calledsimple if each 1-factor ofK 2n appears at most once. Prior to this paper, the only known non-trivial λ-hyperfactorizations had one of the following parameters (or were multipliers of such an example) (i) 2n=2 a +2, λ=1 (for alla≥3); cf. Cameron [3]; (ii) 2n=12, λ=15 or 2n=24, λ=495; cf. Jungnickel and Vanstone [8]. In the present paper we show the existence of non-trivial simple λ-hyperfactorizations ofK 2n for alln≥5.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01375468
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and bounds (1991)
    Springer
    Annals of operations research 33 (1991), S. 151-180 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Given a graphG, themaximum cut problem consists of finding the subsetS of vertices such that the number of edges having exactly one endpoint inS is as large as possible. In the weighted version of this problem there are given real weights on the edges ofG, and the objective is to maximize the sum of the weights of the edges having exactly one endpoint in the subsetS. In this paper, we consider the maximum cut problem and some related problems, likemaximum-2-satisfiability, weighted signed graph balancing. We describe the relation of these problems to the unconstrained quadratic 0–1 programming problem, and we survey the known methods for lower and upper bounds to this optimization problem. We also give the relation between the related polyhedra, and we describe some of the known and some new classes of facets for them.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02115753
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Unconstrained multilayer switchbox routing (1995)
    Springer
    Annals of operations research 58 (1995), S. 481-491 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Consider the gradually more and more complexproblems of single row routing, channel routing and switchbox routing on the one hand, and the gradually less and less restrictivemodels (1-layer, Manhattan, unconstrained 2-layer, multilayer) on the other hand. The single row routing problems can always be solved in the Manhattan model, and the channel routing problem can always be solved in the unconstrained 2-layer model, in fact, both in linear time. In this paper, we show that the switchbox routing problem is solvable in the multilayer model, also in linear time.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02057159
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Sperner extensions of affine spaces (1987)
    Springer
    Geometriae dedicata 22 (1987), S. 163-172 
    Details
    ISSN: 1572-9168
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper Sperner spaces are constructed in which the affine space can be embedded in a certain sense.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00181264
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Probabilistic bounds and algorithms for the maximum satisfiability problem (1989)
    Springer
    Annals of operations research 21 (1989), S. 109-126 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In this paper we present a new method to analyze and solve the maximum satisfiability problem. We randomize the Boolean variables, assign probabilities to their possible values and, by using recently developed probabilistic bounds of the authors, present a deterministic procedure to obtain solution to the maximum satisfiability problem. Our algorithm generalizes the heuristic procedure given by Johnson, 1974.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02022095
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Horn minimization by iterative decomposition (1998)
    Springer
    Annals of mathematics and artificial intelligence 23 (1998), S. 321-343 
    Details
    ISSN: 1573-7470
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Given a Horn CNF representing a Boolean function f, the problem of Horn minimization consists in constructing a CNF representation off which has a minimum possible number of clauses. This problem is the formalization of the problem of knowledge compression for speeding up queries to propositional Horn expert systems, and it is known to be NP-hard. In this paper we present a linear time algorithm which takes a Horn CNF as an input, and through a series of decompositions reduces the minimization of the input CNF to the minimization problem on a“shorter” CNF. The correctness of this decomposition algorithm rests on several interesting properties of Horn functions which, as we prove here, turn out to be independent of the particular CNF representations.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1018932728409
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Diagnosing double regular systems (1999)
    Springer
    Annals of mathematics and artificial intelligence 26 (1999), S. 171-191 
    Details
    ISSN: 1573-7470
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We consider the problem of testing sequentially the components of a multi-component system, when the testing of each component is costly. We propose a new testing policy, that can be executed in polynomial time in the input size, and show that it is cost-minimal in the average case sense, for certain double regular systems that include regular (in particular, threshold) systems with identical components. This result generalizes known results for series, parallel, and, more generally, for k-out-of-n systems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1018958928835
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    On the complexity of the surrogate dual of 0–1 programming (1986)
    Springer
    Mathematical methods of operations research 30 (1986), S. A145 
    Details
    ISSN: 1432-5217
    Keywords: 0–1 programming ; surrogate constraints ; surrogate dual ; ellipsoid algorithm ; complexity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Es wird gezeigt, daß das “surrogate duale” Problem zu einer linearen Optimierungsaufgabe mit binären Variablen durch 0(m 3) Rucksackprobleme gelöst werden kann. Dabei bezeichnetm die Anzahl der Nebenbedingungen.
    Notes: Abstract It is shown that the surrogate dual of a 0–1 programming problem can be solved by 0(m 3) knapsack calls, ifm denotes the number of constraints.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01919175
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Book
    Book
    Discrete optimization : the state of the art; 11 (2003)
    Amsterdam [u.a.] :Elsevier,
    Details
    Title: Discrete optimization : the state of the art; 11
    Contributer: Boros, Endre , Hammer, Peter L.
    Edition: 1
    Publisher: Amsterdam [u.a.] :Elsevier,
    Year of publication: 2003
    Pages: 577 S. : Ill., graph. Darst.
    Series Statement: Topics in discrete mathematics 11
    ISBN: 0-444-51295-0
    Type of Medium: Book
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    ZIB Catalog
    Zuse Institute Berlin get availability status
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...