Algorithms for some graph theoretical optimization problems (abstract of thesis)

DOI10.1007/s10288-006-0010-8zbMath1107.05085OpenAlexW2024658126MaRDI QIDQ862821

Linda S. Moonen

Publication date: 24 January 2007

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-006-0010-8

zbMATH Keywords

Integer programmingBranch-and-price algorithmsPartially ordered sets

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Handle-rewriting hypergraph grammars
• A decomposition theorem for partially ordered sets
• Exact Algorithms for a Loading Problem with Bounded Clique Width