Reformulation of the set partitioning problem as a pure network with special order set constraints

DOI10.1023/A:1018953006796zbMath0911.90332OpenAlexW104965098MaRDI QIDQ1265886

Agha Iqbal Ali, Hyun-Soo Han

Publication date: 27 September 1998

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018953006796

zbMATH Keywords

enumerationtransformationset partitioningreformulationpreprocessingproblem reduction

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (2)

Improving set partitioning problem solutions by zooming around an improving direction ⋮ A concurrent processing framework for the set partitioning problem

This page was built for publication: Reformulation of the set partitioning problem as a pure network with special order set constraints