We address a multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages. Demand cannot be backlogged, but can be totally or partially lost. Safety stock is an objective to reach rather than an industrial constraint to respect. The problem is np-hard. We propose a Lagrangian relaxation of the resource capacity constraints. We develop a dynamic programming algor...

We consider the problem of allocating resources to satisfy demand requirements varying over time. The input specifies a demand for each timeslot. Each resource is specified by a start-time, end-time, an associated cost and a capacity. A feasible solution is a multiset of resources such that at any point of time, the sum of the capacities offered by the resources is at least the demand requireme...

Wind tunnel to Atmospheric Mapping (WAM) is a methodology for scaling and testing a static aeroelastic wind tunnel model. The WAM procedure employs scaling laws to define a wind tunnel model and wind tunnel test points such that the static aeroelastic flight test data and wind tunnel data will be correlated throughout the test envelopes. This methodology extends the notion that a single test co...

This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds at the nodes of the tree. The Lagrangean function exploits the structure of the problem and can be decomposed into smaller subproblems which can be solved efficiently. In addition, some reduction procedures based on the...

Dynamic relaxation of the XY model and fully frustrated XY model quenched from an initial ordered state to the critical temperature or below is investigated with Monte Carlo methods. Universal power law scaling behaviour is observed. The dynamic critical exponent z and the static exponent η are extracted from the time-dependent Binder cumulant and magnetization. The results are competitive to t...

Rights: © 1997 American Institute of Physics. This is the accepted version of the following article: Hirvonen, J.-P. & Koskinen, J. & Kaukonen, M. & Nieminen, Risto M. & Scheibe, H.-J. 1997. Dynamic relaxation of the elastic properties of hard carbon films. Journal of Applied Physics. Volume 81, Issue 11. 7248-7254. ISSN 0021-8979 (printed). DOI: 10.1063/1.365322, which has been published in fi...

BACKGROUND Dielectric spectra of human blood reveal a rich variety of dynamic processes. Achieving a better characterization and understanding of these processes not only is of academic interest but also of high relevance for medical applications as, e.g., the determination of absorption rates of electromagnetic radiation by the human body. METHODS The dielectric properties of human blood are...

We present a new solution to the correspondence problem. It is based on dynamic programming, and can deal with image sequences. The overall potential characterizes the quality of matching of a point, and dynamic programming achieves consistency independently for each edge of the new image. The overall potential is deened on a pair of points as a function of two components : a potential deened f...

This paper introduces algorithms for nonprojective parsing based on dual decomposition. We focus on parsing algorithms for nonprojective head automata, a generalization of head-automata models to non-projective structures. The dual decomposition algorithms are simple and efficient, relying on standard dynamic programming and minimum spanning tree algorithms. They provably solve an LP relaxation...

In this paper, we address the rate control problem for layered multicast sessions, with the objective of solving a generalized throughput/fairness objective. Our approach is based on a combination of lagrangian relaxation and dynamic programming. Unlike previously proposed dual-based approaches, the algorithm presented in this paper scales well as the number of multicast groups in the network i...