Pages that link to "Item:Q1802953"
From MaRDI portal
The following pages link to Gainfree Leontief substitution flow problems (Q1802953):
Displaying 19 items.
- Using separation algorithms to generate mixed integer model reformulations (Q1178714) (← links)
- Sensitivity analysis for Horn formulae (Q1200328) (← links)
- Inference flexibility in Horn clause knowledge bases and the simplex method (Q1319393) (← links)
- Characterizing consistency in probabilistic logic for a class of Horn clauses (Q1340063) (← links)
- Flows on hypergraphs (Q1373748) (← links)
- Consistency, redundancy, and implied equalities in linear systems (Q1380438) (← links)
- Max Horn SAT and the minimum cut problem in directed hypergraphs (Q1380929) (← links)
- A simplex algorithm for a class of Leontief flow problems (Q1381763) (← links)
- Integrated optimization of strategic and tactical planning decisions in forestry (Q1751939) (← links)
- The demand weighted vehicle routing problem (Q1754023) (← links)
- Totally unimodular Leontief directed hypergraphs (Q1904049) (← links)
- The hypergraph assignment problem (Q2339846) (← links)
- Finding the \(K\) best policies in a finite-horizon Markov decision process (Q2433472) (← links)
- Lot sizing with inventory gains (Q2467450) (← links)
- A Hypergraph Network Simplex Algorithm (Q4685765) (← links)
- Facets of the Stochastic Network Flow Problem (Q5124001) (← links)
- Towards the Use of Hypergraphs in Multi-adjoint Logic Programming (Q5215753) (← links)
- Fuzzy logic programs as hypergraphs. Termination results (Q6079415) (← links)
- On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs (Q6564294) (← links)
