The complexity landscape of decompositional parameters for ILP (Q1749387): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Network hub location problems: The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Integer Programming and the Branch-Width of the Constraint Matrix / 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: Fundamentals of parameterized complexity / 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: Counting truth assignments of formulas of bounded tree-width or clique-width / 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: Community Structure Inspired Algorithms for SAT and #SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Applications of Tree-Cut Width / 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: Structural Parameterizations of the Mixed Chinese Postman Problem / 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: 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: Sparsity. Graphs, structures, and algorithms / 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: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths in graphs avoiding forbidden transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4955264 / rank
 
Normal rank

Latest revision as of 16:03, 15 July 2024

scientific article
Language Label Description Also known as
English
The complexity landscape of decompositional parameters for ILP
scientific article

    Statements

    The complexity landscape of decompositional parameters for ILP (English)
    0 references
    0 references
    0 references
    16 May 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    integer linear programming
    0 references
    treewidth
    0 references
    treedepth
    0 references
    (parameterized) complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references