The following pages link to Francisco Trespalacios (Q323167):
Displayed 12 items.
- Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound (Q323168) (← links)
- Global optimization algorithm for capacitated multi-facility continuous location-allocation problems (Q1668802) (← links)
- Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem (Q1686525) (← links)
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902) (← links)
- A note on solving discretely-constrained Nash-Cournot games via complementarity (Q2129561) (← links)
- Algorithmic Approach for Improved Mixed-Integer Reformulations of Convex Generalized Disjunctive Programs (Q2942683) (← links)
- Cutting Plane Algorithm for Convex Generalized Disjunctive Programs (Q3186647) (← links)
- Improving the performance of DICOPT in convex MINLP problems using a feasibility pump (Q4972550) (← links)
- Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming (Q6155058) (← links)
- A note on semi-infinite program bounding methods (Q6330396) (← links)
- A Note on Solving Discretely-Constrained Nash-Cournot Games via Complementarity (Q6336050) (← links)
- Pooling problems under perfect and imperfect competition (Q6379604) (← links)