On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs
type: Item
instance of: scholarly article
title: On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs
zbMATH Open document ID: 0855.90091
DOI: 10.1007/BF02568605
published in: Top
publication date: 1996-11-24T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 940805
zbMATH Keywords: knapsack constraint redundancy
zbMATH Keywords: 0-1 mixed integer programs
zbMATH Keywords: infeasibility
author: Laureano F. Escudero Bueno
author: A. Garin
author: Gloria Pérez
describes a project that uses: MINTO
MaRDI profile type: Publication
cites work: Analysis of mathematical programming problems prior to applying the simplex algorithm
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: Efficient reformulation for 0-1 programs -- methods and computational results
cites work: \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
cites work: On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
cites work: Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
cites work: Q3686494
cites work: Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
cites work: MINTO, a Mixed INTeger Optimizer
cites work: Technical Note—A Note on Zero-One Programming
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems
cites work: Strong formulations for mixed integer programming: A survey
full work available at URL: https://doi.org/10.1007/bf02568605
OpenAlex ID: W1982517620
description: scientific article; zbMATH DE number 940805