Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Advances on strictly \(\varDelta \)-modular IPs - MaRDI portal

Advances on strictly \(\varDelta \)-modular IPs (Q6086017)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7763030

Language	Label	Description	Also known as
English	Advances on strictly \(\varDelta \)-modular IPs	scientific article; zbMATH DE number 7763030

Statements

scholarly article

0 references

Advances on strictly \(\varDelta \)-modular IPs (English)

0 references

0 references

Christian Nöbel

0 references

Richard Santiago

0 references

0 references

Integer Programming and Combinatorial Optimization

0 references

publication date

9 November 2023

0 references

zbMATH Keywords

bounded subdeterminants

0 references

congruency constraints

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-031-32726-1_28

0 references

Regular Matroids Have Polynomial Extension Complexity

0 references

A note on non-degenerate integer programs with small sub-determinants

0 references

A strongly polynomial algorithm for bimodular integer linear programming

0 references

On the maximal number of columns of a \(\varDelta \)-modular matrix

0 references

A construction for binary matroids

0 references

On sub-determinants and the diameter of polyhedra

0 references

Random pseudo-polynomial algorithms for exact matroid problems

0 references

On largest volume simplices and sub-determinants

0 references

Matroid Secretary for Regular and Decomposable Matroids

0 references

Geometric random edge

0 references

On the recognition of \(\{a,b,c\}\)-modular matrices

0 references

On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants

0 references

Minimizing submodular functions over families of sets

0 references

On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems

0 references

An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem

0 references

On integer programming with bounded determinants

0 references

Corrigendum to our paper ''The ellipsoid method and its consequences in combinatorial optimization''

0 references

Geometric algorithms and combinatorial optimization.

0 references

On linear systems with integral valued solutions

0 references

Improving proximity bounds using sparsity

0 references

Polynomial Upper Bounds on the Number of Differing Columns of Δ-Modular Integer Programs

0 references

Submodular minimization under congruency constraints

0 references

A new contraction technique with applications to congruency-constrained cuts

0 references

Randomized Rounding for the Largest Simplex Problem

0 references

The Integrality Number of an Integer Program

0 references

Odd Minimum Cut-Sets and <i>b</i>-Matchings

0 references

0 references

Decomposition of regular matroids

0 references

A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs

0 references

Integer program with bimodular matrix

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-031-32726-1_28

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6086017

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6086017&oldid=37575758"