A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs (Q5002764): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
label / enlabel / en
 
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv classification
 
cs.DS
Property / arXiv classification: cs.DS / rank
 
Normal rank
Property / arXiv classification
 
cs.CC
Property / arXiv classification: cs.CC / rank
 
Normal rank
Property / arXiv classification
 
cs.DM
Property / arXiv classification: cs.DM / rank
 
Normal rank
Property / arXiv classification
 
math.CO
Property / arXiv classification: math.CO / rank
 
Normal rank
Property / arXiv classification
 
math.OC
Property / arXiv classification: math.OC / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1802.05859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization with binet matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial algorithm for bimodular integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finiteness theorems in stochastic integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of simultaneous diophantine approximation in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity landscape of decompositional parameters for ILP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graver basis and proximity techniques for block-structured separable convex integer minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex separable optimization is not much harder than linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4636646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear discrete optimization. An algorithmic theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Parameterized Algorithm for Treedepth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer program with bimodular matrix / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:45, 26 July 2024

scientific article; zbMATH DE number 7376012
Language Label Description Also known as
English
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
scientific article; zbMATH DE number 7376012

    Statements

    0 references
    0 references
    0 references
    28 July 2021
    0 references
    0 references
    integer programming
    0 references
    parameterized complexity
    0 references
    Graver basis
    0 references
    \(n\)-fold integer programming
    0 references
    cs.DS
    0 references
    cs.CC
    0 references
    cs.DM
    0 references
    math.CO
    0 references
    math.OC
    0 references
    0 references