Linear optimization and extensions.

zbMath0926.90068MaRDI QIDQ1296340

Manfred W. Padberg

Publication date: 28 July 1999

Published in: Algorithms and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

ellipsoid algorithm; projective algorithm

Mathematics Subject Classification ID

90C06: Large-scale problems in mathematical programming

90C11: Mixed integer programming

90C05: Linear programming

90C27: Combinatorial optimization

90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming

Related Items

AN INCLUSION–EXCLUSION IDENTITY FOR NORMAL CONES OF POLYHEDRAL SETS, Classical cuts for mixed-integer programming and branch-and-cut, Mathematical programming approaches for classes of random network problems, On the separation of parametric convex polyhedral sets with application in MOLP., The double pivot simplex method, On polyhedral projection and parametric programming, Approximating separable nonlinear functions via mixed zero-one programs, The polytope of degree sequences of hypergraphs, Complexity of necessary efficiency in interval linear programming and multiobjective linear programming, The rank of (mixed-) integer polyhedra, Positive Liouville theorem and asymptotic behaviour for \((p,A)\)-Laplacian type elliptic equations with Fuchsian potentials in Morrey space, Counting arithmetic subgroups and subgroup growth of virtually free groups, Binary choice models with discrete regressors: identification and misspecification, Enclosures for the solution set of parametric interval linear systems