Develops an SDP-based ε-constraint method with non-binary branching and node-reuse enhancements for the bi-objective single-row facility layout problem.
INFOR: Information Systems and Operational Research
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An semidefinite programming-based $\varepsilon$-constraint method for the bi-objective single-row facility layout problem
Develops an SDP-based ε-constraint method with non-binary branching and node-reuse enhancements for the bi-objective single-row facility layout problem.