Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
type: Item
instance of: scholarly article
title: Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
zbMATH Open document ID: 0946.90056
DOI: 10.1016/S0166-218X(99)00225-5
author: Hanif D. Sherali
author: Jonathan C. Smith
author: Warren P. Adams
published in: Discrete Applied Mathematics
publication date: 2000-10-29T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 1428628
zbMATH Keywords: reformulation-linearization technique
zbMATH Keywords: RLT
zbMATH Keywords: linear programming relaxations
zbMATH Keywords: convex hull representations
describes a project that uses: MIPLIB
MaRDI profile type: Publication
Wikidata QID: Q125020038
cites work: Q4321548
cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
cites work: Mixed-integer bilinear programming problems
cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs
cites work: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
cites work: A restricted Lagrangean approach to the traveling salesman problem
cites work: Q3323698
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization
cites work: Q4040221
cites work: Q5688491
cites work: Q5688490
cites work: A Decomposition Algorithm for a Discrete Location-Allocation Problem
cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
cites work: A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
cites work: Q4321564
cites work: Tighter representations for set partitioning problems
cites work: Q4190438
full work available at URL: s0166-218x(99)00225-5
OpenAlex ID: W2090165335
description: scientific article; zbMATH DE number 1428628