7 citations · 7 across the 1 of their papers we have counts for
2 papers
math.OC2025★ 7 cited
Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
Dimitri J. Papageorgiou, Francisco Trespalacios
An elementary, but fundamental, operation in disjunctive programming is a basic step, which is the intersection of two disjunctions to form a new disjunction. Basic steps bring a d…
math.OC2019
A note on semi-infinite program bounding methods
Stuart M. Harwood, Dimitri J. Papageorgiou, Francisco Trespalacios
Semi-infinite programs are a class of mathematical optimization problems with a finite number of decision variables and infinite constraints. As shown by Blankenship and Falk (Blan…