Hybridizing carousel greedy and kernel search: a new approach for the maximum flow problem with conflict constraints (Q6981439)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 8043272
Language Label Description Also known as
default for all languages
No label defined
    English
    Hybridizing carousel greedy and kernel search: a new approach for the maximum flow problem with conflict constraints
    scientific article; zbMATH DE number 8043272

      Statements

      Hybridizing carousel greedy and kernel search: a new approach for the maximum flow problem with conflict constraints (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      20 May 2025
      0 references
      (O) heuristics
      0 references
      conflict constraints
      0 references
      kernel search
      0 references
      carousel greedy
      0 references
      kernousel
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references