Ismael Regis jun. de Farias

From MaRDI portal
Revision as of 15:29, 6 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Ismael Regis jun. de Farias to Ismael Regis jun. de Farias: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:378089

Available identifiers

zbMath Open de-farias.ismael-regis-junMaRDI QIDQ378089

List of research outcomes





PublicationDate of PublicationType
The set partitioning problem in a quantum context2024-01-22Paper
Branch-and-cut for complementarity-constrained optimization2014-12-19Paper
A polyhedral study of the semi-continuous knapsack problem2014-02-03Paper
The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints2013-11-11Paper
A family of inequalities valid for the robust single machine scheduling polyhedron2010-03-18Paper
A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization2009-08-13Paper
A note on the continuous mixing set2009-01-09Paper
A special ordered set approach for optimizing a discontinuous separable piecewise linear function2008-08-06Paper
The mixing-MIR set with divisible capacities2008-06-30Paper
Integer Programming and Combinatorial Optimization2005-12-23Paper
Facets of the Complementarity Knapsack Polytope2005-11-11Paper
https://portal.mardi4nfdi.de/entity/Q47375252004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47375342004-08-11Paper
Models for representing piecewise linear cost functions2004-07-01Paper
Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms2004-03-11Paper
Lifted inequalities for 0-1 mixed integer programming: superlinear lifting2004-03-11Paper
A polyhedral study of the cardinality constrained knapsack problem2003-08-20Paper
https://portal.mardi4nfdi.de/entity/Q44146452003-07-25Paper
A family of inequalities for the generalized assignment polytope2001-12-05Paper
A family of facets for the uncapacitated \(p\)-median polytope2001-10-10Paper
A generalized assignment problem with special ordered sets: a polyhedral approach.2001-07-02Paper
Branch-and-cut for combinatorial optimization problems without auxiliary binary variables2001-01-01Paper

Research outcomes over time

This page was built for person: Ismael Regis jun. de Farias