Pages that link to "Item:Q433830"

The following pages link to A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (Q433830):

Displaying 8 items.

• The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming (Q507318) (← links)
• Testing cut generators for mixed-integer linear programming (Q734353) (← links)
• Cutting plane algorithms for the inverse mixed integer linear programming problem (Q1015310) (← links)
• Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
• Optimal crashing of an activity network with disruptions (Q2149579) (← links)
• A disjunctive cutting plane procedure for general mixed-integer linear programs (Q5930736) (← links)
• Decomposition methods for global solution of mixed-integer linear programs (Q6490313) (← links)
• Unified branch-and-Benders-cut for two-stage stochastic mixed-integer programs (Q6551136) (← links)