scientific article; zbMATH DE number 1064585

MaRDI QIDQ4355916zbMATH OpenFDO

Authors Abilio Lucena, J. E. Beasley

Publication date 25 April 2000

zbMATH Keywords

branch and cut algorithmslinear integer programminglinear mixed-integer programming

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A branch and cut algorithm for the Steiner problem in graphs
• Branch and cut methods for network optimization
• Solving Steiner tree problems in graphs to optimality
• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
• scientific article; zbMATH DE number 2084777

Cited in

(10)

• A branch-and-cut algorithm for the equicut problem
• Pruning by isomorphism in branch-and-cut
• Binary Steiner trees: structural results and an exact solution approach
• Strong lower bounds for the prize collecting Steiner problem in graphs
• Dynamic bundle methods
• Algorithms Solving the Matching Cut Problem
• scientific article; zbMATH DE number 1757963 (Why is no real title available?)
• scientific article; zbMATH DE number 780782 (Why is no real title available?)
• Branch and cut methods for network optimization
• Branch-and-cut algorithms for the covering salesman problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4355916)