# zbMATH — the first resource for mathematics

##### Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

##### Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
##### Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
Robust discrete optimization and network flows. (English) Zbl 1082.90067

The authors propose an approach to address data uncertainty for discrete optimization and network flow problems that allows to control the degree of conservation of the solution and is computationally tractable both theoretically and practically.

Main results: (1) A robust integer programming (IP) problem of moderately size is suggested for an IP problem where both the cost coefficients and the data in the constraints are subject to uncertainty. (2) When only the cost coefficients are subject to uncertainty and the problem is a 0-1 discrete optimization problem on $n$ variables, then they solve the robust counterpart by solving $n+1$ nominal problems. Moreover, if such a problem is an $\alpha$-approximable NP-hard problem, then the robust counterpart remains $\alpha$-approximable. (3) When only the cost coefficients are subject to uncertainty and the problem is a minimum cost flow problem, then the authors proposed a polynomial time algorithm for the robust counterpart by solving a collection of minimum cost flow problems in a modified network.

##### MSC:
 90C10 Integer programming 90B10 Network models, deterministic (optimization) 90C35 Programming involving graphs or networks
##### Keywords:
integer programming; robust optimization; network flows