The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.artint.2021.103561 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3183828382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs from THE BOOK / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network hub location problems: The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Block-Structured Integer Programming and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of vertex integrity and component order connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming and incidence treedepth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for Integer Programs with Block Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Problem of Sidon in Additive Number Theory, and on some Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Layout Problems Parameterized by Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed integer linear programming in process scheduling: modeling, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors to Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors into heterogeneous classes of SAT and CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of test sets in stochastic integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(n\)-fold integer programming in cubic time / 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: About the Complexity of Two-Stage Stochastic IPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling meets \(n\)-fold integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial \(n\)-fold integer programming and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs / 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: Two-dimensional packing problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear discrete optimization. An algorithmic theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4955264 / rank
 
Normal rank

Latest revision as of 00:53, 27 July 2024

scientific article
Language Label Description Also known as
English
The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
scientific article

    Statements

    The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 November 2021
    0 references
    0 references
    integer linear programming
    0 references
    parameterized complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references