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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of symbolic computation Ročník 135; s. 102529
Hlavný autor:	Mattos Langeloh, Gabriel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.07.2026
Predmet:	Gröbner basis Integer programming Multiobjective integer programming Integer programming Gröbner basis Multiobjective integer programming
ISSN:	0747-7171
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!