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

Celý popis

Podrobná bibliografie

Vydáno v:	Mathematical programming Ročník 198; číslo 1; s. 561 - 593
Hlavní autoři:	Fomin, Fedor V., Panolan, Fahad, Ramanujan, M. S., Saurabh, Saket
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2023 Springer
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!