Foundation-penalty cuts for mixed-integer programs.
type: Item
instance of: scholarly article
title: Foundation-penalty cuts for mixed-integer programs.
zbMATH Open document ID: 1041.90032
DOI: 10.1016/S0167-6377(03)00014-2
author: Fred Glover
author: Hanif D. Sherali
published in: Operations Research Letters
publication date: 2003-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 2005444
zbMATH Keywords: Mixed-integer programming
zbMATH Keywords: Cutting planes
zbMATH Keywords: branch and bound penalties
MaRDI profile type: Publication
cites work: A Computational Study of Search Strategies for Mixed Integer Programming
cites work: Disjunctive Programming
cites work: Disjunctive programming: Properties of the convex hull of feasible points
cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs
cites work: Facets of the Knapsack Polytope From Minimal Covers
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: Q4101617
cites work: Polyhedral annexation in mixed integer and combinatorial programming
cites work: Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming
cites work: Q3274590
cites work: Some polyhedra related to combinatorial problems
cites work: Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
cites work: Facet of regular 0–1 polytopes
cites work: Q4132247
cites work: Aggregation and Mixed Integer Rounding to Solve MIPs
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: On the facial structure of set packing polyhedra
cites work: Surrogate Dual Multiplier Search Procedures in Integer Programming
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: Exploiting special structures in constructing a hierarchy of relaxations for \(0-1\) mixed integer problems
cites work: Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
cites work: A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
cites work: Optimization with disjunctive constraints
full work available at URL: s0167-6377(03)00014-2
OpenAlex ID: W2084766565
description: scientific article; zbMATH DE number 2005444