| Publication | Date of Publication | Type |
|---|
Characterizing linearizable QAPs by the level-1 reformulation-linearization technique
Discrete Optimization | 2024-03-27 | Paper |
A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions
Optimization Letters | 2023-03-06 | Paper |
| Polyhedral Analysis of Symmetric Multilinear Polynomials over Box Constraints | 2020-12-11 | Paper |
Convex hull representations of special monomials of binary variables
Optimization Letters | 2019-07-10 | Paper |
Error bounds for monomial convexification in polynomial optimization
Mathematical Programming. Series A. Series B | 2019-05-17 | Paper |
Convex hull characterizations of lexicographic orderings
Journal of Global Optimization | 2016-10-25 | Paper |
Linear programming insights into solvable cases of the quadratic assignment problem
Discrete Optimization | 2015-04-09 | Paper |
RLT insights into lift-and-project closures
Optimization Letters | 2015-02-23 | Paper |
Ideal representations of lexicographic orderings and base-2 expansions of integer variables
Operations Research Letters | 2013-06-24 | Paper |
Base-2 expansions for linearizing products of functions of discrete variables
Operations Research | 2013-03-12 | Paper |
Concise RLT forms of binary programs: a computational study of the quadratic knapsack problem
Naval Research Logistics | 2010-02-12 | Paper |
A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions
Discrete Applied Mathematics | 2009-06-23 | Paper |
A network approach for specially structured linear programs arising in 0-1 quadratic optimization
Discrete Applied Mathematics | 2008-09-10 | Paper |
Linear forms of nonlinear expressions: new insights on old ideas
Operations Research Letters | 2007-10-30 | Paper |
A level-2 reformulation-linearization technique bound for the quadratic assignment problem
European Journal of Operational Research | 2007-03-27 | Paper |
A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
Annals of Operations Research | 2006-03-07 | Paper |
A conditional logic approach for strengthening mixed 0-1 linear programs
Annals of Operations Research | 2006-03-07 | Paper |
Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
Discrete Optimization | 2005-08-22 | Paper |
A simple recipe for concise mixed 0-1 linearizations
Operations Research Letters | 2004-11-19 | Paper |
Exploiting special structures in constructing a hierarchy of relaxations for \(0-1\) mixed integer problems
Operations Research | 2002-02-07 | Paper |
Persistency in 0-1 polynomial programming
Mathematics of Operations Research | 2001-11-26 | Paper |
On using exterior penalty approaches for solving linear programming problems
Computers & Operations Research | 2001-01-01 | Paper |
Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
Discrete Applied Mathematics | 2000-10-29 | Paper |
| scientific article; zbMATH DE number 1302175 (Why is no real title available?) | 2000-04-19 | Paper |
A reformulation-linearization technique for solving discrete and continuous nonconvex problems
Nonconvex Optimization and Its Applications | 1999-03-11 | Paper |
A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
Operations Research Letters | 1996-04-15 | Paper |
A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
Discrete Applied Mathematics | 1995-09-05 | Paper |
| scientific article; zbMATH DE number 714527 (Why is no real title available?) | 1995-01-23 | Paper |
Some applications of nonnegative linear systems: Farkas strikes again
Operations Research Letters | 1995-01-11 | Paper |
Mixed-integer bilinear programming problems
Mathematical Programming. Series A. Series B | 1994-04-04 | Paper |
On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
Discrete Applied Mathematics | 1994-03-03 | Paper |
A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
SIAM Journal on Discrete Mathematics | 1990-01-01 | Paper |
Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
Operations Research | 1990-01-01 | Paper |
A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
Management Science | 1986-01-01 | Paper |
A Decomposition Algorithm for a Discrete Location-Allocation Problem
Operations Research | 1984-01-01 | Paper |
