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