Library

You have 0 saved results.
Mark results and click the "Add To Watchlist" link in order to add them to this list.
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
    Mathematical programming 80 (1998), S. 1-15 
    ISSN: 1436-4646
    Keywords: Minimal test sets for integer programming ; Simplicial complexes ; Maximal lattice free bodies
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Given a genericm × n matrixA, the simplicial complexK(A) is defined to be the collection of simplices representing maximal lattice point free convex bodies of the form {x : Ax ⩽ b}. The main result of this paper is that the topological space associated withK(A) is homeomorphic withR m−1 . © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.
    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...