Francisco Trespalacios

According to our database1, Francisco Trespalacios authored at least 10 papers between 2015 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Improving the performance of DICOPT in convex MINLP problems using a feasibility pump.
Optim. Methods Softw., 2020

2018
Global optimization algorithm for capacitated multi-facility continuous location-allocation problems.
J. Glob. Optim., 2018

Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming.
EURO J. Comput. Optim., 2018

2017
Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem.
Ann. Oper. Res., 2017

2016
Cutting Plane Algorithm for Convex Generalized Disjunctive Programs.
INFORMS J. Comput., 2016

Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound.
Eur. J. Oper. Res., 2016

Cutting planes for improved global logic-based outer-approximation for the synthesis of process networks.
Comput. Chem. Eng., 2016

An MILP-MINLP decomposition method for the global optimization of a source based model of the multiperiod blending problem.
Comput. Chem. Eng., 2016

2015
Algorithmic Approach for Improved Mixed-Integer Reformulations of Convex Generalized Disjunctive Programs.
INFORMS J. Comput., 2015

Improved Big-M reformulation for generalized disjunctive programs.
Comput. Chem. Eng., 2015


  Loading...