Warren P. Adams

Available identifiers

zbMath Open adams.warren-pMaRDI QIDQ207216

List of research outcomes

Publication	Date of Publication	Type
Characterizing linearizable QAPs by the level-1 reformulation-linearization technique	2024-03-27	Paper
A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions	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	2019-07-10	Paper
Error bounds for monomial convexification in polynomial optimization	2019-05-17	Paper
Convex hull characterizations of lexicographic orderings	2016-10-25	Paper
Linear programming insights into solvable cases of the quadratic assignment problem	2015-04-09	Paper
RLT insights into lift-and-project closures	2015-02-23	Paper
Ideal representations of lexicographic orderings and base-2 expansions of integer variables	2013-06-24	Paper
Base-2 Expansions for Linearizing Products of Functions of Discrete Variables	2013-03-12	Paper
Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem	2010-02-12	Paper
A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions	2009-06-23	Paper
A network approach for specially structured linear programs arising in 0-1 quadratic optimization	2008-09-10	Paper
Linear forms of nonlinear expressions: new insights on old ideas	2007-10-30	Paper
A level-2 reformulation-linearization technique bound for the quadratic assignment problem	2007-03-27	Paper
A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems	2006-03-07	Paper
A conditional logic approach for strengthening mixed 0-1 linear programs	2006-03-07	Paper
Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs	2005-08-22	Paper
A simple recipe for concise mixed 0-1 linearizations	2004-11-19	Paper
Exploiting special structures in constructing a hierarchy of relaxations for \(0-1\) mixed integer problems	2002-02-07	Paper
Persistency in 0-1 polynomial programming	2001-11-26	Paper
On using exterior penalty approaches for solving linear programming problems	2001-01-01	Paper
Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations	2000-10-29	Paper
https://portal.mardi4nfdi.de/entity/Q4247442	2000-04-19	Paper
A reformulation-linearization technique for solving discrete and continuous nonconvex problems	1999-03-11	Paper
A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope	1996-04-15	Paper
A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems	1995-09-05	Paper
https://portal.mardi4nfdi.de/entity/Q4321548	1995-01-23	Paper
Some applications of nonnegative linear systems: Farkas strikes again	1995-01-11	Paper
Mixed-integer bilinear programming problems	1994-04-04	Paper
On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems	1994-03-03	Paper
A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems	1990-01-01	Paper
Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems	1990-01-01	Paper
A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems	1986-01-01	Paper
A Decomposition Algorithm for a Discrete Location-Allocation Problem	1984-01-01	Paper

Research outcomes over time

This page was built for person: Warren P. Adams