Showing 1 - 10 of 10
literature, heuristics based on unconstrained continuous non-convex formulations have been proposed (Bomze & Palagi, 2005; Bomze …
Persistent link: https://www.econbiz.de/10011117495
Our paper considers a classic problem in the field of Truss Topology Design, the goal of which is to determine the stiffest truss, under a given load, with a bound on the total volume and discrete requirements in the cross-sectional areas of the bars. To solve this problem we propose a new...
Persistent link: https://www.econbiz.de/10010896575
Persistent link: https://www.econbiz.de/10010845833
This paper provides a canonical dual approach for minimizing a general quadratic function over a set of linear constraints. We first perturb the feasible domain by a quadratic constraint, and then solve a “restricted” canonical dual program of the perturbed problem at each iteration to...
Persistent link: https://www.econbiz.de/10011052648
resource can be arbitrary nonconvex polygons. Moreover, the shapes can have holes and the material can have defective areas … of these is a problem due to Milenkovic that has four nonconvex polygons with 94, 72, 84, and 74 vertices, respectively …
Persistent link: https://www.econbiz.de/10010994017
Persistent link: https://www.econbiz.de/10008591045
Persistent link: https://www.econbiz.de/10008456024
Persistent link: https://www.econbiz.de/10010487598
Persistent link: https://www.econbiz.de/10011372453
Persistent link: https://www.econbiz.de/10012649027