CumInCAD is a Cumulative Index about publications in Computer Aided Architectural Design
supported by the sibling associations ACADIA, CAADRIA, eCAADe, SIGraDi, ASCAAD and CAAD futures

authors Campello, Ruy Eduardo and Maculan, Nelson
year 1982
title On Deep Disjunctive Cutting Planes for Set Partitioning : A Computationally Oriented Research.
source Pittsburgh: Design Research Center, CMU [DRC-70-11-82], 10 p.
summary Several mathematical programming problems can be formulated as Disjunctive Programming Problems. This approach offers a powerful procedure for the generation of new and strong cutting planes with desirable properties. For general integer programs, the traditional cutting plane methodologies proved less efficient than enumerative techniques. However, for certain classes of problems, such as set partitioning, cutting planes are known to be efficient. Since the disjunctive cuts are strong, they can be expected to perform better. This paper reports on computational results with disjunctive B(.) cuts for the set partitioning problem, evaluated in terms of computer resources and other independent measures in solving specific randomly generated test problems under controlled conditions. [includes bibliography].
keywords Mathematics, Operations Research, Integer Programming, Optimization
series CADline
references Content-type: text/plain
last changed 1999/02/15 14:17
HOMELOGIN (you are user _anon_648179 from group guest) Works Powered by SciX Open Publishing Services 1.002