Integer programming with binary and bounded variables via Gröbner bases with applications to multiobjective integer programming

Families of integer programming problems can be solved efficiently in practice once their reduced Gröbner basis is known. However, computing Gröbner bases is often hard, especially when binary or integer bounded variables are present in the problem formulation. In this paper, we study the specific s...

Full description

Bibliographic Details

Published in:	Journal of symbolic computation Vol. 135; p. 102529
Main Author:	Mattos Langeloh, Gabriel
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.07.2026
Subjects:	Gröbner basis Integer programming Multiobjective integer programming Integer programming Gröbner basis Multiobjective integer programming
ISSN:	0747-7171
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!