Des algorithmes linéaires pour les problèmes de partition, de recouvrement et de couplage dans les hypergraphes d'intervalles

DOI10.1051/ro/1979130100131zbMath0413.90053OpenAlexW2586857425MaRDI QIDQ3048585

Michel Gondran

Publication date: 1979

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/104714

zbMATH Keywords

computational complexityinteger programmingdynamic programmingset covering problempolynomial algorithmsbin packing probleminterval hypergraphset partitioning problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Hypergraphs (05C65)

Related Items (1)

The column-circular, subsets-selection problem: Complexity and solutions

This page was built for publication: Des algorithmes linéaires pour les problèmes de partition, de recouvrement et de couplage dans les hypergraphes d'intervalles