Exact Algorithms for a Loading Problem with Bounded Clique Width

DOI10.1287/ijoc.1040.0124zbMath1241.90088OpenAlexW2126963663MaRDI QIDQ2892302

Linda S. Moonen, Frits C. R. Spieksma

Publication date: 18 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a99ef8d8f07df571536023120c657227bd9d992a

zbMATH Keywords

integer programminganalysis of algorithms

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (7)

Algorithms for some graph theoretical optimization problems (abstract of thesis) ⋮ Graph classes with and without powers of bounded clique-width ⋮ Latency-bounded target set selection in social networks ⋮ Partitioning a weighted partial order ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ A tutorial on the use of graph coloring for some problems in robotics ⋮ Solution approaches for storage loading problems with stacking constraints

This page was built for publication: Exact Algorithms for a Loading Problem with Bounded Clique Width