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 3 of 3 for “"iterative rounding algorithm"”.

  1. Algorithms for multi-trip vehicle routing and device to device communications

    … for the problem and a branch and price algorithm is used to solve the model. In each iteration of branch and price, column generation is ap- plied. Based on the different capacities, different subproblems are created to find the best column. We extend Solomon’s instances to evaluate our …

    lethbridge Repository record for Algorithms for multi-trip vehicle routing and device to device communications (opens in a new tab)

  2. Bridging Discrete and Continuous Methods for Faster Optimization and Machine Learning

    … age we are in, it has become commonplace for algorithms to make decisions that impact our lives. Many such algorithms use optimization solvers as a subroutine, and there has been a revived interest in using robust approaches (like first-order optimization methods) that require low memory …

    gatech Repository record for Bridging Discrete and Continuous Methods for Faster Optimization and Machine Learning (opens in a new tab)

  3. Cover Small Cuts and Flexible Graph Connectivity Problems

    … used to prove the approximation ratio of Jain's iterative rounding approximation algorithm does not hold. We show that families of “small cuts” are always strongly pliable, but not all strongly pliable families can be realized as families of small cuts. We prove a 5-approximation algorithm for …

    waterloo Repository record for Cover Small Cuts and Flexible Graph Connectivity Problems (opens in a new tab)