A Class of Logical Inference Problem Solvable by Linear Programming.
Year of publication: |
1992
|
---|---|
Authors: | Conforti, M. ; Cornuejols, G. |
Institutions: | Carnegie Mellon University, Tepper School of Business |
Subject: | economic models | mathematics |
-
Two Index Theorems for Bandit Problems.
Banks, J.s., (1991)
-
Banks, J.s., (1991)
-
An Algorithm to Find Out If the Intersection of M Convex Polyhedral Cones Has a Non Empty Interior
Boyer, M., (1976)
- More ...
-
Balance O, +- Matrices, Bicoloring and Total Dual Integrality.
Conforti, M., (1992)
-
From Totality Unimodular to Bakanced 0 +- Matrices : A Family of Integer Polytopes.
Conforti, M., (1992)
-
Conforti, M., (1994)
- More ...