On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid (Q2828332): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Improved Algorithms for Economic Lot Size Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4257216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of the Capacitated Lot Size Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Production Planning with Concave Costs and Capacity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Production Planning: Algorithms and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum concave-cost network flow problems: Applications, complexity, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time solvable concave network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum concave cost flow over a grid network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Facilities in Series Inventory Model with Nested Schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-size models with backlogging: Strong reformulations and cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production Planning by Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four equivalent lot-sizing models / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>(<i>T</i><sup>3</sup>) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated Lot Sizing in Serial Supply Chains with Production Capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Version of the Economic Lot Size Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands / rank
 
Normal rank

Latest revision as of 18:53, 12 July 2024

scientific article
Language Label Description Also known as
English
On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid
scientific article

    Statements

    On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 October 2016
    0 references
    minimum-concave-cost flow
    0 references
    two-dimensional grid
    0 references
    lot sizing
    0 references
    serial supply chain
    0 references
    computational complexity
    0 references
    polynomial-time algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references