Exact algorithms for a loading problem with bounded clique width

DOI10.1287/IJOC.1040.0124MaRDI QIDQ2892302zbMATH OpenOpenAlexFDO

Authors 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

analysis of algorithmsinteger programming

Mathematics Subject Classification ID

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

Recommendations

• A branch-and-cut algorithm for the pallet loading problem
• An exact algorithm for the pallet loading problem
• Solving the pallet loading problem
• Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
• Practical Considerations of the Pallet-Loading Problem

Cited in

(9)

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

This page was built for publication: Exact algorithms for a loading problem with bounded clique width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892302)