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

From MaRDI portal

Revision as of 21:41, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3048585

Jump to:navigation, search

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 complexity integer programming dynamic programming set covering problem polynomial algorithms bin packing problem interval hypergraph set 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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3048585&oldid=16088984"