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
    A recursive procedure to generate all cuts for 0–1 mixed integer programs (1990)
    Springer
    Mathematical programming 46 (1990), S. 379-390 
    Details
    ISSN: 1436-4646
    Keywords: Cutting planes ; valid inequalities ; disjunctive inequalities ; superadditive functions ; 0–1 mixed integer programs
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We study several ways of obtaining valid inequalities for mixed integer programs. We show how inequalities obtained from a disjunctive argument can be represented by superadditive functions and we show how the superadditive inequalities relate to Gomory's mixed integer cuts. We also show how all valid inequalities for mixed 0–1 programs can be generated recursively from a simple subclass of the disjunctive inequalities.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01585752
    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...