branch-and-cut

E1813483 UNEXPLORED

Branch-and-cut is an algorithmic framework for solving integer and mixed-integer programming problems that combines branch-and-bound search with cutting-plane techniques to tighten the linear relaxation.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
branch-and-cut canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Gomory cuts → relatedTo → branch-and-cut ⓘ

subject linked to: Gomory cuts in integer programming