Test sets of integer programs
type: Item
instance of: scholarly article
title: Test sets of integer programs
zbMATH Open document ID: 0927.90086
DOI: 10.1007/BF01193834
author: Robert Weismantel
published in: Mathematical Methods of Operations Research
publication date: 1999-08-22T00:00:00Z
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 1326507
zbMATH Keywords: survey
zbMATH Keywords: reduced Gröbner basis
zbMATH Keywords: minimum cost flow
zbMATH Keywords: knapsack
zbMATH Keywords: matroid optimization
zbMATH Keywords: augmentation problem
zbMATH Keywords: Graver test set
describes a project that uses: GRIN
MaRDI profile type: Publication
cites work: Q4234128
cites work: Q4693774
cites work: Q4038746
cites work: An integer analogue of Carathéodory's theorem
cites work: Q4477738
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Q3768918
cites work: An application of simultaneous diophantine approximation in combinatorial optimization
cites work: Scaling algorithms for network problems
cites work: Total dual integrality and integer polyhedra
cites work: On the foundations of linear and integer linear programming I
cites work: Q4871776
cites work: Geometric algorithms and combinatorial optimization
cites work: Minkowski's Convex Body Theorem and Integer Programming
cites work: Covering minima and lattice-point-free convex bodies
cites work: The Shapes of Polyhedra
cites work: Production Sets with Indivisibilities, Part I: Generalities
cites work: Neighborhood Systems for Production Sets with Indivisibilities
cites work: Q3818127
cites work: Variation of cost functions in integer programming
cites work: Gröbner bases of lattices, corner polyhedra, and integer programming
cites work: A Geometric Buchberger Algorithm for Integer Programming
cites work: Truncated Gröbner bases for integer programming
cites work: A Variant of the Buchberger Algorithm for Integer Programming
cites work: Q4111952
description: scientific article; zbMATH DE number 1326507