Results 1  10
of
104
VLSI cell placement techniques
 ACM Computing Surveys
, 1991
"... VLSI cell placement problem is known to be NP complete. A wide repertoire of heuristic algorithms exists in the literature for efficiently arranging the logic cells on a VLSI chip. The objective of this paper is to present a comprehensive survey of the various cell placement techniques, with emphasi ..."
Abstract

Cited by 93 (0 self)
 Add to MetaCart
VLSI cell placement problem is known to be NP complete. A wide repertoire of heuristic algorithms exists in the literature for efficiently arranging the logic cells on a VLSI chip. The objective of this paper is to present a comprehensive survey of the various cell placement techniques, with emphasis on standard ce11and macro
A stochastic programming approach for supply chain network design under uncertainty
, 2003
"... ..."
Decomposition Algorithms for Stochastic Programming on a Computational Grid
 Computational Optimization and Applications
, 2001
"... . We describe algorithms for twostage stochastic linear programming with recourse and their implementation on a grid computing platform. In particular, we examine serial and asynchronous versions of the Lshaped method and a trustregion method. The parallel platform of choice is the dynamic, heter ..."
Abstract

Cited by 61 (7 self)
 Add to MetaCart
(Show Context)
. We describe algorithms for twostage stochastic linear programming with recourse and their implementation on a grid computing platform. In particular, we examine serial and asynchronous versions of the Lshaped method and a trustregion method. The parallel platform of choice is the dynamic, heterogeneous, opportunistic platform provided by the Condor system. The algorithms are of masterworker type (with the workers being used to solve secondstage problems), and the MW runtime support library (which supports masterworker computations) is key to the implementation. Computational results are presented on large sample average approximations of problems from the literature. 1.
An approach for strategic supply chain planning under uncertainty based on stochastic 01 programming
 J. of Global Opt
, 2003
"... Abstract. We present a twostage stochastic 01 modeling and a related algorithmic approach for Supply Chain Management under uncertainty, whose goal consists of determining the production topology, plant sizing, product selection, product allocation among plants and vendor selection for raw materia ..."
Abstract

Cited by 31 (5 self)
 Add to MetaCart
Abstract. We present a twostage stochastic 01 modeling and a related algorithmic approach for Supply Chain Management under uncertainty, whose goal consists of determining the production topology, plant sizing, product selection, product allocation among plants and vendor selection for raw materials. The objective is the maximization of the expected benefit given by the product net profit over the time horizon minus the investment depreciation and operations costs. The main uncertain parameters are the product net price and demand, the raw material supply cost and the production cost. The first stage is included by the strategic decisions. The second stage is included by the tactical decisions. A tight 01 model for the deterministic version is presented. A splitting variable mathematical representation via scenario is presented for the stochastic version of the model. A twostage version of a Branch and Fix Coordination (BFC) algorithmic approach is proposed for stochastic 01 program solving, and some computational experience is reported for cases with dozens of thousands of constraints and continuous variables and hundreds of 01 variables.
Algorithms and software for convex mixed integer nonlinear programs
, 2009
"... HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract

Cited by 28 (4 self)
 Add to MetaCart
(Show Context)
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
Hybrid Benders Decomposition Algorithms in Constraint Logic Programming
 In Procs. of the 7th Intern. Conference on Principles and Practice of Constraint Programming  CP 2001
, 2001
"... Benders Decomposition is a form of hybridisation that allows linear programming to be combined with other kinds of algorithms. It extracts new constraints for one subproblem from the dual values of the other subproblem. This paper describes an implementation of Benders Decomposition, in the ECLiPSe ..."
Abstract

Cited by 28 (1 self)
 Add to MetaCart
(Show Context)
Benders Decomposition is a form of hybridisation that allows linear programming to be combined with other kinds of algorithms. It extracts new constraints for one subproblem from the dual values of the other subproblem. This paper describes an implementation of Benders Decomposition, in the ECLiPSe language, that enables it to be used within a constraint programming framework. The programmer is spared from having to write down the dual form of any subproblem, because it is derived by the system. Examples are used to show how problem constraints can be modelled in an undecomposed form. The programmer need only specify which variables belong to which subproblems, and the Benders Decomposition is extracted automatically. A class of minimal perturbation problems is used to illustrate how dierent kinds of algorithms can be used for the dierent subproblems. The implementation is tested on a set of minimal perturbation benchmarks, and the results are analysed.
The N k Problem in Power Grids: New Models, Formulations and Numerical Experiments
, 2008
"... Given a power grid modeled by a network together with equations describing the power flows, power generation and consumption, and the laws of physics, the socalled N − k problem asks whether there exists a set of k or fewer arcs whose removal will cause the system to fail. The case where k is small ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
(Show Context)
Given a power grid modeled by a network together with equations describing the power flows, power generation and consumption, and the laws of physics, the socalled N − k problem asks whether there exists a set of k or fewer arcs whose removal will cause the system to fail. The case where k is small is of practical interest. We present theoretical and computational results involving a mixedinteger model and a continuous nonlinear model related to this question.
A Finite Branch and Bound Algorithm for TwoStage Stochastic Integer Programs
, 2000
"... This paper addresses a general class of twostage stochastic programs with integer recourse and discrete distributions. We exploit the structure of the value function of the second stage integer problem to develop a novel global optimization algorithm. The proposed scheme departs from those in the c ..."
Abstract

Cited by 21 (6 self)
 Add to MetaCart
This paper addresses a general class of twostage stochastic programs with integer recourse and discrete distributions. We exploit the structure of the value function of the second stage integer problem to develop a novel global optimization algorithm. The proposed scheme departs from those in the current literature in that it avoids explicit enumeration of the search space while guaranteeing finite termination. Our computational results indicate superior performance of the proposed algorithm in comparison to the existing literature. Keywords: stochastic integer programming, branch and bound, finite algorithms. 1 Introduction Under the twostage stochastic programming paradigm, the decision variables of an optimization problem under uncertainty are partitioned into two sets. The first stage variables are those that have to be decided before the actual realization of the uncertain parameters. Subsequently, once the random events have presented themselves, further design or operational ...
Multidisciplinary design optimization: A Survey of architectures
 AIAA Journal
"... Multidisciplinary design optimization (MDO) is a field of research that studies the application of numerical optimization techniques to the design of engineering systems involving multiple disciplines or components. Since the inception of MDO, various methods (architectures) have been developed and ..."
Abstract

Cited by 20 (8 self)
 Add to MetaCart
(Show Context)
Multidisciplinary design optimization (MDO) is a field of research that studies the application of numerical optimization techniques to the design of engineering systems involving multiple disciplines or components. Since the inception of MDO, various methods (architectures) have been developed and applied to solve MDO problems. This paper provides a survey of all the architectures that have been presented in the literature so far. All architectures are explained in detail using a unified description that includes optimization problem statements, diagrams, and detailed algorithms. The diagrams show both data and process flow through the multidisciplinary system and computational elements, which facilitates the understanding of the various architectures, and how they relate to each other. A classification of the MDO architectures based on their problem formulations and decomposition strategies is also provided, and the benefits and drawbacks of the architectures are discussed from both a theoretical and experimental perspective. For each architecture, several applications to the solution of engineering design problems are cited. The result is a comprehensive but straightforward introduction to MDO for nonspecialists, and a reference detailing all current MDO architectures for specialists. I.