scientific article

zbMath0483.90086MaRDI QIDQ3942759

Rainer E. Burkard, Uwe T. Zimmermann

Publication date: 1982

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

surveyschedulingcombinatorial optimizationtransportation problemsduality theorypath problemssemimodulesnetwork flow problemsalgebraic objective functionsalgebraic assignmentcoefficients in semigroupsindependent set problemssum-, bottleneck-, lexicographic solution procedures

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10) Nonlinear programming (90C30) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10) Paths and cycles (05C38) Programming in abstract spaces (90C48) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Boolean programming (90C09) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Ordered semigroups and monoids (06F05) Semigroups (20M99)

Related Items

Max-balanced flows in oriented matroids ⋮ Flow symmetry and algebraic flows ⋮ A survey for the quadratic assignment problem ⋮ On the role of bottleneck Monge matrices in combinatorial optimization ⋮ Characterizations of max-balanced flows ⋮ Discrete optimization: an Austrian view ⋮ Selected topics on assignment problems ⋮ Bottleneck Capacity Expansion Problems with General Budget Constraints ⋮ The algebraic Monge property and path problems ⋮ An analogue of Hoffman's circulation conditions for max-balanced flows ⋮ An out-of-kilter method for the algebraic circulation problem ⋮ An improved general procedure for lexicographic bottleneck problems ⋮ On abstract duality in mathematical programming