ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

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 separation algorithm for the matchable set polytope (1994)
    Springer
    Mathematical programming 65 (1994), S. 139-150 
    Details
    ISSN: 1436-4646
    Keywords: Combinatorial optimization ; Polyhedra ; Matching ; Matchable set ; Separation algorithm ; Augmenting path
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A matchable set of a graph is a set of vertices joined in pairs by disjoint edges. Balas and Pulleyblank gave a linear-inequality description of the convex hull of matchable sets. We give a polynomial-time combinatorial algorithm for the separation problem for this polytope, and a min—max theorem characterizing the maximum violation by a given point of an inequality of the system.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01581694
    Location Call Number Expected 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...