Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 4 of 4 for “"Lagrangean relaxation"”.

  1. Optimizing paint blocking in an automobile assembly line : an application of specialized TSP's

    … special problem structure to solve the LP relaxation of this problem quickly using Lagrangean relaxation. We prove and use an order-within-color property to construct an enumerative formulation, and use a greedy approach to bound the LP optimum. We decompose the problem and solve smaller …

    mit Repository record for Optimizing paint blocking in an automobile assembly line : an application of specialized TSP's (opens in a new tab)

  2. Mathematical programming approach to cell formation problems in flexible manufacturing systems.

    … new parts to the existing part families. Lagrangean relaxation based methods are used to solve the models presented in this dissertation. Alternate relaxations have been compared in terms of the computational time and the quality of bounds obtained. In Models 1 and 2, relaxing the machine …

    windsor Repository record for Mathematical programming approach to cell formation problems in flexible manufacturing systems. (opens in a new tab)

  3. Optimally Locating Facilities with Variable Characteristics

    … and propose three methods for its solution: a Lagrangean heuristic, a branch-and-bound method with Lagrangean relaxation, and a branch-and-bound method with nonlinear programming relaxation. The computational results obtained on a set of problem instances show that the branch-and-bound method …

    liege Repository record for Optimally Locating Facilities with Variable Characteristics (opens in a new tab)

  4. Large-scale optimization for data placement problem

    lethbridge