scientific article
From MaRDI portal
Publication:3737235
zbMath0601.90111MaRDI QIDQ3737235
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
shortest pathmatroidsgraph partitioninggreedy type algorithmsflows in series-parallel networksgreedy-coloring
Extremal problems in graph theory (05C35) Integer programming (90C10) Deterministic network models in operations research (90B10)
Related Items (9)
Greedy concepts for network flow problems ⋮ Permuting matrices to avoid forbidden submatrices ⋮ Strong unimodularity for matrices and hypergraphs ⋮ Trapezoid graphs and their coloring ⋮ Technical Note—A Monge Sequence-Based Approach to Characterize the Competitive Newsvendor Problem ⋮ Perspectives of Monge properties in optimization ⋮ A ranking model for the greedy algorithm and discrete convexity ⋮ On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint ⋮ Series parallel composition of greedy linear programming problem
This page was built for publication:
