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 20 of 77 for “"Set partitioning"”.

  1. Bus crew scheduling and the set partitioning model

    … of a bus crew scheduling method, based on a set partitioning model, for the Christchurch Transport Board, New Zealand. It also examines in detail the effects of the high degree of degeneracy in scheduling set partitioning models. Degeneracy can cause severe computational difficulties because …

    auckland-ms Repository record for Bus crew scheduling and the set partitioning model (opens in a new tab)

  2. Exploiting consecutive ones structure in the set partitioning problem

    The Set Partitioning Problem (SPP) is one of the most extensively researched models in integer optimization, and is widely applied in operations research. SPP is used for crew scheduling, vehicle routing, stock cutting, production scheduling, and many other combinatorial problems. The power and …

    nps Repository record for Exploiting consecutive ones structure in the set partitioning problem (opens in a new tab)

  3. Algorithms and hardware for the solution of set partitioning problems

    … integer linear programming problem, called the set partitioning problem. The problem is: minimize cx, subject to Ax=e, where A is a binary matrix, e is a column of ones, and c is a cost vector. Despite its particularly simple structure, the set partitioning problem has practical applications in …

    ubc Repository record for Algorithms and hardware for the solution of set partitioning problems (opens in a new tab) Download PDF for Algorithms and hardware for the solution of set partitioning problems (opens in a new tab)

  4. A constraint branch-and-bound method for set partitioning problems

    … variable branch-and-bound method in solving set partitioning problems. Because of the difficulties encountered in writing the constraint branch-and-bound subroutine, it was necessary to solve each subproblem encountered from scratch. This is in contrast to the variable branching code which, …

    nps Repository record for A constraint branch-and-bound method for set partitioning problems (opens in a new tab)

  5. On Maximum Weight Independent Sets and the Set Partitioning Problem

    Made available in DSpace on 2014-12-14T13:09:44Z (GMT). No. of bitstreams: 1 8009103.pdf: 2080632 bytes, checksum: 8b27f27acb1dd7e80416171889173a3d (MD5) Previous issue date: 1979

    uiuc Repository record for On Maximum Weight Independent Sets and the Set Partitioning Problem (opens in a new tab)

  6. Computational advances in the solution of large-scale covering and set partitioning problems

    The Set Covering Problem (SCP) and the Set Partitioning Problem (SPP) represent an important class of all-binary (0-1) Integer Linear Programs (ILP). A review of the literature reveals extensive application of the SPP/SCP model to a wide set of practical problems. The basic model is explained, and …

    nps Repository record for Computational advances in the solution of large-scale covering and set partitioning problems (opens in a new tab)

  7. Parallelization of the set partitioning method for optimally solving the vehicle routing problem

    … of problem the solution method addresses. The Set Partitioning method has been used to solve this problem optimally. The Set Partitioning method consists of three steps. The serial versions of code in each step could be parallelized to obtain a speedup at each step, and an overall speedup for …

    ut-knoxville Repository record for Parallelization of the set partitioning method for optimally solving the vehicle routing problem (opens in a new tab)

  8. The complexity of some set-partitioning formulations for the vehicle routing problem with stochastic demands

    … with a given capacity to deliver goods to a set of customers with known demands, with the goal being to find the cheapest such set of routes. In the CVRPSD, rather than being deterministic, customer demands are random variables from a given probability distribution. This creates the …

    waterloo Repository record for The complexity of some set-partitioning formulations for the vehicle routing problem with stochastic demands (opens in a new tab)

  9. Bandwidth efficient trellis coding for unitary space-time modulation in a non-coherent mimo system

    … we proposed a systematic ``mapping by set partitioning" strategy for the TC-USTM. We also proposed the multiple trellis-coded USTM (MTC-USTM), where each trellis branch is assigned multiple USTM signals. A systematic set partitioning scheme is developed for the k-fold Cartesian product …

    nus Repository record for Bandwidth efficient trellis coding for unitary space-time modulation in a non-coherent mimo system (opens in a new tab) Download file for Bandwidth efficient trellis coding for unitary space-time modulation in a non-coherent mimo system (opens in a new tab)

  10. Modeling and algorithmic development of a staff scheduling problem

    … to trucks and vice-versa. We show that this is a set partitioning problem with an additional feasibility constraint which can be solved using the column generation technique. An inherent characteristic of this problem that makes it different from other set partitioning problems is that the arrival …

    vt Repository record for Modeling and algorithmic development of a staff scheduling problem (opens in a new tab)

  11. CREW SCHEDULING PROBLEMS IN THE AIRLINE INDUSTRY

    … The problem is formulated as a large scale set partitioning problem. Optimal solutions to large scale set partitioning problems are difficult to obtain. To date, no effective algorithm has been discovered that will find an optimal set partitioning solution in polynomial time. In this thesis, …

    nus Repository record for CREW SCHEDULING PROBLEMS IN THE AIRLINE INDUSTRY (opens in a new tab) Download file for CREW SCHEDULING PROBLEMS IN THE AIRLINE INDUSTRY (opens in a new tab)

  12. Combined objective least squares and long step primal dual subproblem simplex methods

    … to the primal dual subproblem simplex method for set partitioning/packing/covering problems with convexity constraints. Primal dual subproblem simplex methods are very successful in solving large-scale set partitioning problems. In each step of the primal dual subproblem simplex method, dual …

    gatech Repository record for Combined objective least squares and long step primal dual subproblem simplex methods (opens in a new tab)

  13. Quantum Algorithms for Integer Programming Problems

    … Quantum Eigensolver algorithm to solve the Set partitioning problem. The results of this study highlight the potential of quantum computing to provide efficient solutions to important optimization problems.

    ttu Repository record for Quantum Algorithms for Integer Programming Problems (opens in a new tab)

  14. Constraint satisfaction approaches to bus driver scheduling

    … to different regulations. In particular, a set partitioning formulation is used. It then makes use of the structure of the problem and the relaxed linear programming solution to the problem in producing a schedule. The GENET system has been adapted to cope with minimising the numbers of …

    whiterose Download PDF for Constraint satisfaction approaches to bus driver scheduling (opens in a new tab)

  15. The polyhedral structure of certain combinatorial optimization problems with application to a naval defense problem

    … bounding (GUS) constrained knapsack problem, the set partitioning problem, and the quadratic zero-one programming problem, and applies related techniques to solve a practical combinatorial naval defense problem. In Part I of this research effort, we present new results on the polyhedral structure …

    vt Repository record for The polyhedral structure of certain combinatorial optimization problems with application to a naval defense problem (opens in a new tab)

  16. Airline crew pairing optimization problems and capacitated vehicle routing problems

    … stored in the duty tree and can be enumerated. A set partitioning formulation is then constructed, and the problem is solved using a primal-dual subproblem simplex method tailored to the duty tree approach. Computational experiments are conducted to show the effectiveness of the methods. We also …

    gatech Repository record for Airline crew pairing optimization problems and capacitated vehicle routing problems (opens in a new tab)

  17. A column generation technique for a crisis deployment planning problem.

    … optimal military deployment plan for sealift assets during a period of conflict. The deployment problem is formulated as a set-partitioning optimization problem with a minimax objective. An algorithm for solving this problem is presented and it is based on solving a sequence of related, but …

    nps Repository record for A column generation technique for a crisis deployment planning problem. (opens in a new tab)

  18. Low bit-rate wavelet based video codec for internet applications

    … implementation and performance of the 3D-Color Set Partitioning In Hierarchical Trees (3D-CSPIHT) scheme in the context of 3D wavelet based video coding. The 3D-CSPIHT exploits the correlation between temporal and spatial wavelet coefficients and the inter-dependency between luminance and …

    nus Repository record for Low bit-rate wavelet based video codec for internet applications (opens in a new tab) Download file for Low bit-rate wavelet based video codec for internet applications (opens in a new tab)

Page 1 of 4