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
Filter
  • Integer Programming  (1)
  • 1
    Electronic Resource
    Electronic Resource
    (1,k)-configurations and facets for packing problems (1980)
    Springer
    Mathematical programming 18 (1980), S. 94-99 
    Details
    ISSN: 1436-4646
    Keywords: Integer Programming ; Integral Polyhedra ; Linear Inequalities ; Facets
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A new class of facets for knapsack polytopes is obtained. This class of inequalities is shown to define a polytope with zero–one vertices only. A combinatorial inequality is obtained from Fulkerson's max—max inequality.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588301
    Library Location Call Number Volume/Issue/Year 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...