default search action
Francisco Trespalacios
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Stuart M. Harwood
, Francisco Trespalacios, Dimitri J. Papageorgiou, Kevin C. Furman:
Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming. Comput. Optim. Appl. 87(2): 641-676 (2024) - 2023
- [j12]Dimitri J. Papageorgiou
Pooling problems under perfect and imperfect competition. Comput. Chem. Eng. 169: 108067 (2023) - 2021
- [j11]Stuart M. Harwood
A note on semi-infinite program bounding methods. Optim. Lett. 15(4): 1485-1490 (2021) - 2020
- [j10]David E. Bernal
Improving the performance of DICOPT in convex MINLP problems using a feasibility pump. Optim. Methods Softw. 35(1): 171-190 (2020)
2010 – 2019
- 2018
- [j9]Dimitri J. Papageorgiou, Francisco Trespalacios:
Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming. EURO J. Comput. Optim. 6(1): 55-83 (2018) - [j8]Cristiana L. Lara, Francisco Trespalacios, Ignacio E. Grossmann
Global optimization algorithm for capacitated multi-facility continuous location-allocation problems. J. Glob. Optim. 71(4): 871-889 (2018) - 2017
- [j7]Francisco Trespalacios, Ignacio E. Grossmann:
Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem. Ann. Oper. Res. 258(2): 747-759 (2017) - 2016
- [j6]Irene Lotero, Francisco Trespalacios, Ignacio E. Grossmann, Dimitri J. Papageorgiou, Myun-Seok Cheon:
An MILP-MINLP decomposition method for the global optimization of a source based model of the multiperiod blending problem. Comput. Chem. Eng. 87: 13-35 (2016) - [j5]Francisco Trespalacios, Ignacio E. Grossmann:
Cutting planes for improved global logic-based outer-approximation for the synthesis of process networks. Comput. Chem. Eng. 90: 201-221 (2016) - [j4]Francisco Trespalacios, Ignacio E. Grossmann:
Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound. Eur. J. Oper. Res. 253(2): 314-327 (2016) - [j3]Francisco Trespalacios, Ignacio E. Grossmann:
Cutting Plane Algorithm for Convex Generalized Disjunctive Programs. INFORMS J. Comput. 28(2): 209-222 (2016) - 2015
- [j2]Francisco Trespalacios, Ignacio E. Grossmann:
Improved Big-M reformulation for generalized disjunctive programs. Comput. Chem. Eng. 76: 98-103 (2015) - [j1]Francisco Trespalacios, Ignacio E. Grossmann:
Algorithmic Approach for Improved Mixed-Integer Reformulations of Convex Generalized Disjunctive Programs. INFORMS J. Comput. 27(1): 59-74 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: