Cumincad : CUMINCAD Papers : Search Results

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

PDF papers
References

Hits 1 to 3 of 3

Reformat results as: short short into frame detailed detailed into frame

_id	c832
authors	Rinderle, J.R. and Suh, N.P.
year	1983
title	Measures of Functional Coupling in Design
source	Pittsburgh, PA: Design Research Center, CMU, December, 1983. 6 p. : some ill. includes bibliography
summary	Algebraic and geometric representations of the general design problem are presented. Quantitative measures of functional coupling in design are developed from this representation which provide valuable insight into the significance of the independence axiom of design. These theoretical measures are applied to Reaction Injection Molding machinery to illustrate the concept of functional independence and the application of quantitative measures of functional coupling
keywords	design, theory, mechanical engineering
series	CADline
last changed	2003/06/02 13:58

_id	88b6
authors	Campello, Ruy Eduardo and Maculan, Nelson
year	1983
title	A Lower Bound to the Set Partitioning Problem with Side Constraints
source	24 p. : ill. Pittsburgh: Design Research Center, CMU, December, 1983 DRC-70-20-83. includes bibliography.
summary	A Lagrangean relaxation approach is proposed to provide a lower bound on the optimal solution of the set partitioning problem with side constraints, which is a general methodology to solve a combinatorial optimization problem. This Lagrangean relaxation approach is accomplished by a subgradient optimization procedure which solves at each iteration a special 0-1 knapsack problem. The approach seems to be promising since it produces feasible integer solutions to the side constraints that can hopefully be the optimal solution to most of the instances of the set partitioning problem with side constraints
keywords	mathematics, operations research, relaxation, algorithms, combinatorics, optimization, constraints
series	CADline
last changed	2003/06/02 13:58

_id	ad7d
authors	Sethi, Awanti P. and Thompson, Gerald L.
year	1983
title	Solution of Constrained Generalized Transportation Problems Using the Pivot and Probe Algorithm
source	17 p. Pittsburgh PA: Design Research Center, CMU, December, 1983. DRC-70-17-83. includes bibliography
summary	In this paper the authors use a specialized version of their Pivot and Probe algorithm to solve generalized transportation problems with side constraints. The dual of an m x n generalized transportation problem with t side constraints is a linear program with m + n + t variables and up to m x n constraints. They solve the dual problem using the probe operation to select only the most important constraints to consider. Also presented is a computational experience on problems of sizes up to 180 x 180, having various degrees of density and having as many as 10 side constraints. It was found that for a given size and density, problems become harder to solve as the number of side constraints increases. Ô h)000*°° ÔŒ Also, for a fixed number of side constraints, the solution difficulty increases with size and density. The authors found that their method was able to solve problems of the quoted sizes relatively quickly, with relatively few pivots, and without using basis reinversion
keywords	linear programming, topology, planning, constraints, operations research, algorithms, methods
series	CADline
last changed	2003/06/02 10:24

No more hits.