A strongly polynomial algorithm to solve combinatorial linear programs
Year of publication: |
1986
|
---|---|
Authors: | Tardos, Eva |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 34.1986, 2, p. 250-256
|
Subject: | Programmanalyse kombinatorisch | Programmanalyse linear | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
A polyhedral description of kernels
Chen, Qin, (2016)
-
On the query complexity of Black-Peg AB-mastermind
Ouali, Mourad el, (2018)
-
A simple algorithm for solving Ramsey optimal policy with exogenous forcing variables
Chatelain, Jean-Bernard, (2017)
- More ...
-
Bounding the inefficiency of equilibria in nonatomic congestion games
Roughgarden, Tim, (2004)
-
Matroids from crossing families
Frank, András, (1982)
-
An application of the simultaneous approximation in combinatorial optimization
Frank, András, (1985)
- More ...