Gainfree Leontief substitution flow problems (Q1802953): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Linear-time computation of optimal subgraphs of decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Pass Algorithms for Some Generalized Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advantageous Properties of Dual Transhipment Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solution of a Dynamic Leontief Model with Substitution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming is log-space hard for P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality of Stationary Halting Policies and Finite Termination of Successive Approximations / 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: Total dual integrality and integer polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hirsch Conjecture in Leontief Substitution Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4153609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3262596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4077718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral Characterization of Discrete Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth Optimality for Branching Markov Decision Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme points of Leontief substitution systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Dynamic Programming with Sensitive Discount Optimality Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Class of Capacitated Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740231 / rank
 
Normal rank

Latest revision as of 17:42, 17 May 2024

scientific article
Language Label Description Also known as
English
Gainfree Leontief substitution flow problems
scientific article

    Statements

    Gainfree Leontief substitution flow problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 June 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Leontief matrices
    0 references
    polyhedral combinatorics
    0 references
    expert systems
    0 references
    Leontief substitution systems
    0 references
    Leontief substitution flow problem
    0 references
    directed hypergraphs
    0 references
    support disjoint reachability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references