default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIsmael R. de Farias Jr.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Rafael Cação
, Lucas R. C. T. Cortez, Jackson Forner, Hamidreza Validi, Ismael R. de Farias Jr., Illya V. Hicks:
The set partitioning problem in a quantum context. Optim. Lett. 18(1): 1-17 (2024)- 2021
- [j20]Rafael Cação, Lucas R. C. T. Cortez, Ismael R. de Farias Jr., Ernee Kozyreff, Jalil Khatibi Moqadam, Renato Portugal:
Quantum Walk on the Generalized Birkhoff Polytope Graph. Entropy 23(10): 1239 (2021)
2010 – 2019
- 2015
- [j19]Ernee Kozyreff, Ismael R. de Farias Jr.:
A note on critical-set and lifted surrogate inequalities for cardinality-constrained linear programs. Comput. Ind. Eng. 82: 1-7 (2015) - 2014
- [j18]Ismael R. de Farias Jr., Ernee Kozyreff, Ming Zhao:
Branch-and-cut for complementarity-constrained optimization. Math. Program. Comput. 6(4): 365-403 (2014) - 2013
- [j17]Ming Zhao, Ismael Regis de Farias Jr.:
The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints. Math. Program. 141(1-2): 217-255 (2013) - [j16]Ismael Regis de Farias Jr., Ming Zhao:
A polyhedral study of the semi-continuous knapsack problem. Math. Program. 142(1-2): 169-203 (2013) - [j15]Ismael R. de Farias Jr., Ernee Kozyreff, R. Gupta, Ming Zhao:
Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints. Math. Program. Comput. 5(1): 75-112 (2013) - 2010
- [j14]Ismael Regis de Farias Jr., Hongxia Zhao, Ming Zhao:
A family of inequalities valid for the robust single machine scheduling polyhedron. Comput. Oper. Res. 37(9): 1610-1614 (2010)
2000 – 2009
- 2008
- [j13]Ming Zhao, Ismael R. de Farias Jr.:
The mixing-MIR set with divisible capacities. Math. Program. 115(1): 73-103 (2008) - [j12]Ismael R. de Farias Jr., Ming Zhao, Hai Zhao:
A special ordered set approach for optimizing a discontinuous separable piecewise linear function. Oper. Res. Lett. 36(2): 234-238 (2008) - [j11]Ming Zhao, Ismael R. de Farias Jr.:
A note on the continuous mixing set. Oper. Res. Lett. 36(6): 726-733 (2008) - 2006
- [j10]Ahmet B. Keha, Ismael R. de Farias Jr., George L. Nemhauser:
A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization. Oper. Res. 54(5): 847-858 (2006) - 2004
- [j9]Ahmet B. Keha, Ismael R. de Farias Jr., George L. Nemhauser:
Models for representing piecewise linear cost functions. Oper. Res. Lett. 32(1): 44-48 (2004) - [c4]Ismael R. de Farias Jr.:
Semi-continuous Cuts for Mixed-Integer Programming. IPCO 2004: 163-177 - 2003
- [j8]Ismael R. de Farias Jr., George L. Nemhauser:
A polyhedral study of the cardinality constrained knapsack problem. Math. Program. 96(3): 439-467 (2003) - [j7]Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser:
Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms. Math. Program. 98(1-3): 89-113 (2003) - [j6]Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser:
Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting. Math. Program. 98(1-3): 115-143 (2003) - 2002
- [j5]Ismael R. de Farias Jr., Ellis L. Johnson, George L. Nemhauser:
Facets of the Complementarity Knapsack Polytope. Math. Oper. Res. 27(1): 210-226 (2002) - [c3]Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser:
Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms. IPCO 2002: 161-175 - [c2]Ismael R. de Farias Jr., George L. Nemhauser:
A Polyhedral Study of the Cardinality Constrained Knapsack Problem. IPCO 2002: 291-303 - 2001
- [j4]Ismael R. de Farias Jr., Ellis L. Johnson, George L. Nemhauser:
Branch-and-cut for combinatorial optimization problems without auxiliary binary variables. Knowl. Eng. Rev. 16(1): 25-39 (2001) - [j3]Ismael R. de Farias Jr.:
A family of facets for the uncapacitated p-median polytope. Oper. Res. Lett. 28(4): 161-167 (2001) - [j2]Ismael R. de Farias Jr., George L. Nemhauser:
A family of inequalities for the generalized assignment polytope. Oper. Res. Lett. 29(2): 49-55 (2001) - [c1]Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser:
A Simplex-Based Algorithm for 0-1 Mixed Integer Programming. Combinatorial Optimization 2001: 158-170 - 2000
- [j1]Ismael R. de Farias Jr., Ellis L. Johnson, George L. Nemhauser:
A generalized assignment problem with special ordered sets: a polyhedral approach. Math. Program. 89(1): 187-203 (2000)
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 2024-10-07 22:06 CEST 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:
