The search session has expired. Please query the service again.

Displaying similar documents to “Lower bounds to the graph partitioning problem through generalized linear programming and network flows”

Towards optimal formwork pairing on construction sites

Thierry Benoist (2007)

RAIRO - Operations Research

Similarity:

Minimizing shutterings assembling time on construction sites can yield significant savings in labor costs and crane moves. It requires solving a pairing problem that optimizes the ability for the crane to move chains of shutterings as a whole when they can be later reused together to frame another wall of the site. In this paper, we show that this problem is NP-hard in the strong sense as well as both its multiflow and ordering aspects. We also introduce a linear relaxation that computes...