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 algorithmprojective algorithm

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Mixed integer programming (90C11) Linear programming (90C05) Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items

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