High-multiplicity \(N\)-fold IP via configuration LP (Q6044979): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-022-01882-9 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Approximation schemes for scheduling on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permuting Sparse Rectangular Matrices into Block-Diagonal Form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Dantzig-Wolfe reformulation of mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing Matrices into Blocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling Salesman Problem with Many Visits to Few Cities / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(N\)-fold integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma / 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: Bin packing can be solved within 1+epsilon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning mathematical programs for parallel solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / 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: Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem / 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: On Integer Programming and Convolution. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time <i>OPT</i> + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5090421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure Detection in Mixed-Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling meets \(n\)-fold integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of configuration integer programs / 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: Nonlinear discrete optimization. An algorithmic theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Huge multiway table problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach for Sequencing Groups of Identical Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The modified integer round-up property of the one-dimensional cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: To the Steinitz lemma in coordinate form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Machine Scheduling by Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulation and Decomposition of Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Egyptian Fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rearranging Matrices to Block-Angular form for Decomposition (And Other) Algorithms / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-022-01882-9 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:56, 30 December 2024

scientific article; zbMATH DE number 7689163
Language Label Description Also known as
English
High-multiplicity \(N\)-fold IP via configuration LP
scientific article; zbMATH DE number 7689163

    Statements

    High-multiplicity \(N\)-fold IP via configuration LP (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 May 2023
    0 references
    integer programming
    0 references
    configuration IP
    0 references
    fixed-parameter algorithms
    0 references
    scheduling
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers