The following pages link to Warren P. Adams (Q207216):
Displaying 36 items.
- (Q330272) (redirect page) (← links)
- Convex hull characterizations of lexicographic orderings (Q330274) (← links)
- Mixed-integer bilinear programming problems (Q687032) (← links)
- (Q817193) (redirect page) (← links)
- A conditional logic approach for strengthening mixed 0-1 linear programs (Q817194) (← links)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← links)
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization (Q943852) (← links)
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998) (← links)
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems (Q1280199) (← links)
- On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems (Q1314325) (← links)
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems (Q1329799) (← links)
- Some applications of nonnegative linear systems: Farkas strikes again (Q1342285) (← links)
- A simple recipe for concise mixed 0-1 linearizations (Q1886797) (← links)
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope (Q1892658) (← links)
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations (Q1975377) (← links)
- RLT insights into lift-and-project closures (Q2257076) (← links)
- Convex hull representations of special monomials of binary variables (Q2311191) (← links)
- Linear programming insights into solvable cases of the quadratic assignment problem (Q2339831) (← links)
- Ideal representations of lexicographic orderings and base-2 expansions of integer variables (Q2376730) (← links)
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (Q2386196) (← links)
- Error bounds for monomial convexification in polynomial optimization (Q2414910) (← links)
- Linear forms of nonlinear expressions: new insights on old ideas (Q2457269) (← links)
- A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions (Q2688908) (← links)
- Persistency in 0-1 Polynomial Programming (Q2757539) (← links)
- Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems (Q2770136) (← links)
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems (Q3197621) (← links)
- A Decomposition Algorithm for a Discrete Location-Allocation Problem (Q3337913) (← links)
- Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118) (← links)
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems (Q3762072) (← links)
- (Q4247442) (← links)
- (Q4321548) (← links)
- Base-2 Expansions for Linearizing Products of Functions of Discrete Variables (Q4909117) (← links)
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems (Q5202509) (← links)
- On using exterior penalty approaches for solving linear programming problems (Q5945315) (← links)
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique (Q6122081) (← links)
