On the optimality of pseudo-polynomial algorithms for integer programming

In the classic Integer Programming Feasibility (IPF) problem, the objective is to decide whether, for a given m × n matrix A and an m -vector b = ( b 1 , ⋯ , b m ) , there is a non-negative integer n -vector x such that A x = b . Solving (IPF) is an important step in numerous algorithms and it is im...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Mathematical programming Jg. 198; H. 1; S. 561 - 593
Hauptverfasser:	Fomin, Fedor V., Panolan, Fahad, Ramanujan, M. S., Saurabh, Saket
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2023 Springer
Schlagworte:	Algorithms Calculus of Variations and Optimal Control; Optimization Combinatorics Full Length Paper Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Theoretical Integer programming Algorithms and data structures 68Q25 Analysis of algorithms and problem complexity 68W01 General topics in the theory of algorithms
ISSN:	0025-5610, 1436-4646
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!