Linear and combinatorial optimization in ordered algebraic structures
Publication:1155513
zbMath0466.90045MaRDI QIDQ1155513
Publication date: 1981
Published in: Annals of Discrete Mathematics (Search for Journal in Brave)
semigroupscombinatorial optimizationdualitygraph theorylatticessemiringsbranch and bound methodsemimodulesmatroid theoryrelaxationsindependence systemsalgebraic optimizationgreedy methodstability of matricesmaximum spanning treealgebraic flow problemsalgebraic matching problemsalgebraic path problemsordered algebraic systems
Programming involving graphs or networks (90C35) Trees (05C05) Extremal problems in graph theory (05C35) Integer programming (90C10) Linear programming (90C05) Commutative semigroups (20M14) Deterministic network models in operations research (90B10) Enumeration in graph theory (05C30) Paths and cycles (05C38) Programming in abstract spaces (90C48) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Boolean programming (90C09) Combinatorial aspects of matroids and geometric lattices (05B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Combinatorial aspects of packing and covering (05B40) Lattices (06B99) Ordered structures (06Fxx)
Related Items (only showing first 100 items - show all)
This page was built for publication: Linear and combinatorial optimization in ordered algebraic structures