Pages that link to "Item:Q323168"

The following pages link to Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound (Q323168):

Displaying 2 items.

• Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902) (← links)
• Scalable branching on dual decomposition of stochastic mixed-integer programming problems (Q2125568) (← links)