Gainfree Leontief substitution flow problems
From MaRDI portal
(Redirected from Publication:1802953)
Recommendations
Cites work
- scientific article; zbMATH DE number 3145626 (Why is no real title available?)
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- scientific article; zbMATH DE number 3974289 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3495849 (Why is no real title available?)
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 3586493 (Why is no real title available?)
- Advantageous Properties of Dual Transhipment Polyhedra
- Discrete Dynamic Programming with Sensitive Discount Optimality Criteria
- Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
- Extreme points of Leontief substitution systems
- Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
- Growth Optimality for Branching Markov Decision Chains
- Linear programming is log-space hard for P
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Linear-time computation of optimal subgraphs of decomposable graphs
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
- On a class of capacitated transportation problems
- One-Pass Algorithms for Some Generalized Network Problems
- Optimal Solution of a Dynamic Leontief Model with Substitution
- Optimality of Stationary Halting Policies and Finite Termination of Successive Approximations
- Polyhedral Characterization of Discrete Dynamic Programming
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- The Hirsch Conjecture in Leontief Substitution Systems
- Total dual integrality and integer polyhedra
Cited in
(21)- Finding the \(K\) best policies in a finite-horizon Markov decision process
- A simplex algorithm for a class of Leontief flow problems
- A combinatorial certifying algorithm for linear programming problems with gainfree Leontief substitution systems
- Max Horn SAT and the minimum cut problem in directed hypergraphs
- The hypergraph assignment problem
- On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs
- The demand weighted vehicle routing problem
- Substitutes and Complements in Constrained Linear Models
- Totally unimodular Leontief directed hypergraphs
- Characterizing consistency in probabilistic logic for a class of Horn clauses
- Inference flexibility in Horn clause knowledge bases and the simplex method
- Using separation algorithms to generate mixed integer model reformulations
- Consistency, redundancy, and implied equalities in linear systems
- Flows on hypergraphs
- Fuzzy logic programs as hypergraphs. Termination results
- Facets of the stochastic network flow problem
- Towards the Use of Hypergraphs in Multi-adjoint Logic Programming
- Sensitivity analysis for Horn formulae
- Lot sizing with inventory gains
- A hypergraph network simplex algorithm
- Integrated optimization of strategic and tactical planning decisions in forestry
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)
