The following pages link to (Q5389783):
Displaying 4 items.
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902) (← links)
- An inexact interior-point Lagrangian decomposition algorithm with inexact oracles (Q2188950) (← links)
- Solving the linear complementarity problem through concave programming (Q3346107) (← links)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds (Q3780005) (← links)