Report of the Session on Algorithms for Special Classes of Combinatorial Optimization Problems

DOI10.1016/S0167-5060(08)70833-1zbMath0412.68035MaRDI QIDQ4199521

Uri N. Peled, Jan Karel Lenstra

Publication date: 1979

Published in: Discrete Optimization I, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium (Search for Journal in Brave)

zbMATH Keywords

partitioncombinatorial optimizationpolynomial-time algorithmmatroidparitymatching problemsgraphical algorithmsmaximum independent set problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of partitions of integers (05A17) Combinatorial aspects of matroids and geometric lattices (05B35) Enumerative combinatorics (05A99) Graph theory (05C99) Designs and configurations (05B99)

Related Items (1)

A class of facet producing graphs for vertex packing polyhedra

This page was built for publication: Report of the Session on Algorithms for Special Classes of Combinatorial Optimization Problems