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 6 of 6 for “"subgradient optimization"”.

  1. Optimal configuration of digital communication network

    … problem. The Lagrangian relaxation method and subgradient optimization procedure have been used to find reasonably good feasible solutions. Although the reliability for computer communication networks is as important as the cost factor, only the cost factor is considered in the context of this …

    nps Repository record for Optimal configuration of digital communication network (opens in a new tab)

  2. A discrete equal-capacity p-Median problem

    … of a reformulated problem via a conjugate subgradient optimization procedure. We obtain Benders’ cuts from the above procedures and proceed to a modified Benders’ approach to solve the continuous relaxation of the original problem. Finally a branch-and-bound algorithm that enumerates over …

    vt Repository record for A discrete equal-capacity p-Median problem (opens in a new tab)

  3. Stochastic shortest path algorithm based on Lagrangian relaxation

    … close to the optimal is achieved through subgradient optimization. Among the candidate paths obtained, the best solution becomes the ultimate solution of our algorithm for the original cost function under parameter variation. The algorithm presented in this work can handle any graph …

    uiuc Repository record for Stochastic shortest path algorithm based on Lagrangian relaxation (opens in a new tab)

  4. Limited Memory Space Dilation and Reduction Algorithms

    … of the difference between two successive subgradients, is recognized as being one of the most effective procedures for solving nondifferentiable optimization problems. However, the method needs to store the space dilation matrix and update it at every iteration, resulting in a substantial …

    vt Repository record for Limited Memory Space Dilation and Reduction Algorithms (opens in a new tab)

  5. Enhanced Formulations for Minimax and Discrete Optimization Problems with Applications to Scheduling and Routing

    … 0-1 problems in concert with deflected/conjugate subgradient algorithms. In addition, we propose two general purpose lifting mechanisms for tightening the mathematical programming formulations associated with such minimax optimization problems. Next, we explore novel continuous nonconvex as well …

    vt Repository record for Enhanced Formulations for Minimax and Discrete Optimization Problems with Applications to Scheduling and Routing (opens in a new tab)

  6. Integrated Aircraft Fleeting, Routing, and Crew Pairing Models and Algorithms for the Airline Industry

    The air transportation market has been growing steadily for the past three decades since the airline deregulation in 1978. With competition also becoming more intense, airline companies have been trying to enhance their market shares and profit margins by composing favorable flight schedules and by …

    vt Repository record for Integrated Aircraft Fleeting, Routing, and Crew Pairing Models and Algorithms for the Airline Industry (opens in a new tab)