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 9 of 9 for “"problem solvability"”.

  1. Optimization and Algorithms for Wireless Networks: Enhancing Problem Solvability, Channel Bonding Under Demand Stochasticity, and Receiver Characteristic Awareness

    … dissertation, we discuss three distinct research problems related to this theme. The first part addresses enhancing the solvability of network optimization problems. For the class of problems studied, we show that a traditionally-formulated model is insufficient from a problem-solving perspective. …

    vt Repository record for Optimization and Algorithms for Wireless Networks: Enhancing Problem Solvability, Channel Bonding Under Demand Stochasticity, and Receiver Characteristic Awareness (opens in a new tab)

  2. Decentralized Problems of Discrete-Event Systems: Epistemic Reasoning and Graph Representation

    … provides modelling formalisms for decentralized problems of discrete-event systems for better derivation of problem solvability and solution constructions and for comparison of one decentralized architecture with another. The thesis establishes equivalence between three classes of …

    queens Repository record for Decentralized Problems of Discrete-Event Systems: Epistemic Reasoning and Graph Representation (opens in a new tab)

  3. The Dehn function, word problem, and bounded word problem for finitely generated decidable group presentations

    For finite group presentations, the word problem is solvable if and only if the Dehn function is computable. Additionally, the bounded word problem is always solvable. For finitely generated decidable group presentations, this is not always the case. The main result of the present work is to …

    uiuc Repository record for The Dehn function, word problem, and bounded word problem for finitely generated decidable group presentations (opens in a new tab)

  4. Resident Scheduling Problem

    … thesis is concerned with the Resident Scheduling Problem (RSP) in which a good schedule is desired that will meet both departmental requirements and residents' preferences. Three scenarios that represent most situations and account for various departmental requirements and needs are described. …

    vt Repository record for Resident Scheduling Problem (opens in a new tab)

  5. Lagrangian Relaxation Approaches to Cardinality Constrained Portfolio Selection

    … cardinality constrained portfolio selection problems, known as Index Tracking and Financial Planning. Index Tracking is a typical application of the cardinality constrained portfolio selection process and has attracted much attention from portfolio managers. However, replicating unpredictable …

    toronto-retro Repository record for Lagrangian Relaxation Approaches to Cardinality Constrained Portfolio Selection (opens in a new tab)

  6. Advances in Portfolio Selection Under Discrete Choice Constraints: A Mixed-integer Programming Approach and Heuristics

    … quantitative analysis of key money management problems. The primary area of interest is Portfolio Selection, where we develop advanced financial models that are designed for investment problems of the 21st century. Portfolio selection is the process involved in making large investment decisions …

    toronto-retro Repository record for Advances in Portfolio Selection Under Discrete Choice Constraints: A Mixed-integer Programming Approach and Heuristics (opens in a new tab)

  7. Understanding the Role and Importance of Design Problems in Creativity Research

    … the need for using similar conceptual design problems in experiments in engineering design creativity. This is accomplished by addressing three sub-objectives i) to identify the pattern of design problem usage, ii) to enable comparison between two conceptual design problems based on their …

    clemson Repository record for Understanding the Role and Importance of Design Problems in Creativity Research (opens in a new tab)

  8. Integrated Airline Operations: Schedule Design, Fleet Assignment, Aircraft Routing, and Crew Scheduling

    … use of analytical techniques to solve complex problems related to airline operations planning, which includes schedule design, fleet assignment, aircraft routing, and crew scheduling. The initial problem addressed by airlines is that of schedule design, whereby a set of flights having specific …

    vt Repository record for Integrated Airline Operations: Schedule Design, Fleet Assignment, Aircraft Routing, and Crew Scheduling (opens in a new tab)

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

    … the general class of minimax mixed-integer 0-1 problems of the type that frequently arise in decomposition approaches and in a variety of location and scheduling problems. We conduct an extensive polyhedral analysis of this problem in order to tighten its representation using the …

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