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 “"Node packing"”.

  1. Solving structured 0/1 integer programs arising from truck dispatching scheduling problems

    … and utilized to obtain an approximating node-packing polytope for the convex hull of all 0/1 solutions. The branch-and-cut solver generates cuts based on both the knapsack constraints and the approximating node-packing polytope, and incorporates these cuts into a tree-search algorithm …

    rice Repository record for Solving structured 0/1 integer programs arising from truck dispatching scheduling problems (opens in a new tab)

  2. Topics in Packing and Scheduling

    Packing and scheduling models include some of the most fundamental problems in operations research and computer science. These broad classes include a wide range of models with applications including logistics, production planning, wireless network design, circuit design, and cloud computing, to …

    gatech Repository record for Topics in Packing and Scheduling (opens in a new tab)

  3. TUNING OPTIMIZATION SOFTWARE PARAMETERS FOR MIXED INTEGER PROGRAMMING PROBLEMS

    … the ramp loss and L1-norm regularization, and node packing for coding theory graphs. This research presents and demonstrates a framework for tuning a portfolio of MIP instances to not only obtain good parameter settings used for future instances of the same class of MIPs, but to also gain …

    vcu Repository record for TUNING OPTIMIZATION SOFTWARE PARAMETERS FOR MIXED INTEGER PROGRAMMING PROBLEMS (opens in a new tab)

  4. Combinatorial optimization and application to DNA sequence analysis

    … constrained network flow problem and weighted node packing problem. The integer programming models are solved in a branch and bound setting using simultaneous column and row generation. The methodology developed will also be useful to solve large scale integer programming problems arising in …

    gatech Repository record for Combinatorial optimization and application to DNA sequence analysis (opens in a new tab)

  5. Resource constrained shortest paths and extensions

    … which seeks a minimum cost path between two nodes in a directed graph subject to a finite set of resource constraints. Although NP-hard, the RCSPP is extremely useful in practice and often appears as a subproblem in many decomposition schemes for difficult optimization problems. We begin with …

    gatech Repository record for Resource constrained shortest paths and extensions (opens in a new tab)