scientific article; zbMATH DE number 1488891

MaRDI QIDQ4495728zbMATH OpenFDO

Authors Louis Caccetta

Publication date 10 August 2000

zbMATH Keywords

branch and cutcombinatorial optimizationcutting planesmixed integer programmingscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Branch and cut methods for network optimization
• scientific article; zbMATH DE number 2084777
• Computational Integer Programming and Cutting Planes
• Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
• An application of branch and cut to open pit mine scheduling

Cited in

(12)

• Integrating facility layout design and aisle structure in manufacturing systems: formulation and exact solution
• Arc routing under uncertainty: introduction and literature review
• Branch and cut method for solving integer indefinite quadratic bilevel programs
• An approach for the optimal solution of MILP problems
• Effective algorithms for a class of discrete valued optimal control problems
• On t-branch split cuts for mixed-integer programs
• Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
• scientific article; zbMATH DE number 2084777 (Why is no real title available?)
• Branch-and-cut for complementarity-constrained optimization
• Decomposition Branching for Mixed Integer Programming
• Classical cuts for mixed-integer programming and branch-and-cut
• An implicit branch-and-bound algorithm for mixed-integer linear programming

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 Q4495728)