Gainfree Leontief substitution flow problems
DOI10.1007/BF01581090zbMATH Open0778.90080OpenAlexW2060416492MaRDI QIDQ1802953FDOQ1802953
Jinchang Wang, Ronald L. Rardin, Kipp Martin, Robert G. Jeroslow
Publication date: 29 June 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581090
Recommendations
directed hypergraphspolyhedral combinatoricsexpert systemsLeontief substitution systemsLeontief matricesLeontief substitution flow problemsupport disjoint reachability
Linear programming (90C05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Integer programming (90C10) Mixed integer programming (90C11) Multisectoral models in economics (91B66)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Discrete Dynamic Programming with Sensitive Discount Optimality Criteria
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
- On a class of capacitated transportation problems
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Title not available (Why is that?)
- Linear programming is log-space hard for P
- Polyhedral Characterization of Discrete Dynamic Programming
- Linear-time computation of optimal subgraphs of decomposable graphs
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Optimality of Stationary Halting Policies and Finite Termination of Successive Approximations
- Total dual integrality and integer polyhedra
- Extreme points of Leontief substitution systems
- Optimal Solution of a Dynamic Leontief Model with Substitution
- Title not available (Why is that?)
- Growth Optimality for Branching Markov Decision Chains
- Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
- Title not available (Why is that?)
- Advantageous Properties of Dual Transhipment Polyhedra
- Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
- The Hirsch Conjecture in Leontief Substitution Systems
- One-Pass Algorithms for Some Generalized Network Problems
Cited In (20)
- A simplex algorithm for a class of Leontief flow problems
- On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs
- The hypergraph assignment problem
- Max Horn SAT and the minimum cut problem in directed hypergraphs
- Facets of the Stochastic Network Flow Problem
- The demand weighted vehicle routing problem
- Substitutes and Complements in Constrained Linear Models
- Totally unimodular Leontief directed hypergraphs
- A Hypergraph Network Simplex Algorithm
- Characterizing consistency in probabilistic logic for a class of Horn clauses
- Inference flexibility in Horn clause knowledge bases and the simplex method
- Consistency, redundancy, and implied equalities in linear systems
- Using separation algorithms to generate mixed integer model reformulations
- Fuzzy logic programs as hypergraphs. Termination results
- Flows on hypergraphs
- Towards the Use of Hypergraphs in Multi-adjoint Logic Programming
- Sensitivity analysis for Horn formulae
- Lot sizing with inventory gains
- Integrated optimization of strategic and tactical planning decisions in forestry
- Finding the \(K\) best policies in a finite-horizon Markov decision process
This page was built for publication: Gainfree Leontief substitution flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802953)
