Other Applied Mathematics Commons^™

Automating Course Scheduling With Linear Programming And The Python Pulp Framework: First Steps, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

This article presents a pragmatic approach to automating course scheduling in an academic setting using linear programming.

We explore how linear optimization via current open-source tools can efficiently handle scheduling constraints such as instructor preferences, teaching loads, course section requirements, and specific time slots. Using Python’s PuLP library and matplotlib for visualization, we built a flexible and accessible scheduling system.

Our research prototype balances course assignments while addressing department-specific needs, demonstrating how linear programming can simplify academic scheduling and improve efficiency.

Although this is a research prototype, our results already demonstrate the ability to generate a correct course schedule that …

Swarming Segregation: Leveraging Swarm Intelligence And Regionalization As Instruments For School District Desegregation, Jeffrey Wooten

Theses and Dissertations

Even after Brown led to the South briefly having the most diverse schools in the nation, schools throughout the Northeast have remained the most segregated in the nation for decades. While federal jurisprudence has made compelling desegregation pursuant to the Equal Protection Clause more challenging, New Jersey has a particularly favorable landscape to address severe segregation. With a highly diverse, densely populated public enrollment, favorable state constitutional precedent, and a history of successfully compelling desegregation, New Jersey is fertile ground exploring regional desegregation. Scholars, judges, and even plaintiffs in ongoing litigation (Latino Action Network v. N.J.) have called for New …

Multi-Commodity Flow Models For Logistic Operations Within A Contested Environment, Isabel Strinsky

All Theses

Today's military logistics officers face a difficult challenge, generating route plans for mass deployments within contested environments. The current method of generating route plans is inefficient and does not assess the vulnerability within supply networks and chains. There are few models within the current literature that provide risk-averse solutions for multi-commodity flow models. In this thesis, we discuss two models that have the potential to aid military planners in creating route plans that account for risk and uncertainty. The first model we introduce is a continuous time model with chance constraints. The second model is a two-stage discrete time model …

Creating The Optimal Wedding Seating Chart, Madison Lane

Theses/Capstones/Creative Projects

The purpose of this project is to develop an effective seating arrangement for a wedding reception that enhances the comfort of guests. The ultimate aim is to create a harmonious and enjoyable atmosphere for all attendees. To achieve this, an integer program was designed to optimize the seating arrangement for the author’s upcoming wedding on May 27th, 2023. To ensure accuracy and feasibility, actual feedback was gathered from the guests to evaluate their compatibility and preferences. The proposed seating chart optimization not only addresses the placement of guests but also determines the number of tables required for the reception. The …

Quantum Computing And Its Applications In Healthcare, Vu Giang

OUR Journal: ODU Undergraduate Research Journal

This paper serves as a review of the state of quantum computing and its application in healthcare. The various avenues for how quantum computing can be applied to healthcare is discussed here along with the conversation about the limitations of the technology. With more and more efforts put into the development of these computers, its future is promising with the endeavors of furthering healthcare and various other industries.

Dynamic Nonlinear Gaussian Model For Inferring A Graph Structure On Time Series, Abhinuv Uppal

CMC Senior Theses

In many applications of graph analytics, the optimal graph construction is not always straightforward. I propose a novel algorithm to dynamically infer a graph structure on multiple time series by first imposing a state evolution equation on the graph and deriving the necessary equations to convert it into a maximum likelihood optimization problem. The state evolution equation guarantees that edge weights contain predictive power by construction. After running experiments on simulated data, it appears the required optimization is likely non-convex and does not generally produce results significantly better than randomly tweaking parameters, so it is not feasible to use in …

Optimal Design Problems With State Constraints, Nha Van Tran

LSU Doctoral Dissertations

This thesis focuses on constrained optimization problems with constraints on the state variables. When the constraints involve partial differential equations or variational inequalities, the optimization problem is also known as Mathematical Programs with Equilibrium Constraints. First, we applied active-set properties of optimal solutions to transform variational inequality constraints into partial differential equation constraints and devised an active-set method which allowed us to solve the optimization problems using the adjoint approach. We extended our approach to evolution problems with constraints on the trajectory of the state variable, such as the irreversibility condition in fracture mechanics. We implemented a gradient descent algorithm …

Combinatorial Optimization: Introductory Problems And Methods, Erin Brownell

Honors Scholar Theses

This paper will cover some topics of combinatorial optimization, the study of finding the best possible arrangement of a set of discrete objects. These topics include the shortest path problem and network flows, which can be extended to solve more complex problems. We will also briefly cover some basics of graph theory and solving linear programming problems to give context to the reader.

Network Analytics For The Mirna Regulome And Mirna-Disease Interactions, Joseph Jayakar Nalluri

Theses and Dissertations

miRNAs are non-coding RNAs of approx. 22 nucleotides in length that inhibit gene expression at the post-transcriptional level. By virtue of this gene regulation mechanism, miRNAs play a critical role in several biological processes and patho-physiological conditions, including cancers. miRNA behavior is a result of a multi-level complex interaction network involving miRNA-mRNA, TF-miRNA-gene, and miRNA-chemical interactions; hence the precise patterns through which a miRNA regulates a certain disease(s) are still elusive. Herein, I have developed an integrative genomics methods/pipeline to (i) build a miRNA regulomics and data analytics repository, (ii) create/model these interactions into networks and use optimization techniques, motif …

Modeling And Control Of Nanoparticle Bloodstream Concentration For Cancer Therapies, Scarlett S. Bracey

Doctoral Dissertations

Currently, the most commonly used treatments for cancerous tumors (chemotherapy, radiation, etc.) have almost no method of monitoring the administration of the treatment for adverse effects in real time. Without any real time feedback or control, treatment becomes a "guess and check" method with no way of predicting the effects of the drugs based on the actual bioavailability to the patient's body. One particular drug may be effective for one patient, yet provide no benefit to another. Doctors and scientists do not routinely attempt to quantifiably explain this discrepancy. In this work, mathematical modeling and analysis techniques are joined together …

On The Performance Of A Hybrid Genetic Algorithm In Dynamic Environments, Quan Yuan, Zhixin Yang

Mathematics Faculty Research Publications

The ability to track the optimum of dynamic environments is important in many practical applications. In this paper, the capability of a hybrid genetic algorithm (HGA) to track the optimum in some dynamic environments is investigated for different functional dimensions, update frequencies, and displacement strengths in different types of dynamic environments. Experimental results are reported by using the HGA and some other existing evolutionary algorithms in the literature. The results show that the HGA has better capability to track the dynamic optimum than some other existing algorithms.

Generating Minimal Pair-Wise Covering Test Suites, Luis C. Gutierrez ^, Martine Ceberio *

COURI Symposium Abstracts, Spring 2012

Software is ubiquitous and needs to be reliable. Software testing therefore plays an important role in software development. Proper testing a software system informs about its quality and reliability so as to prevent unexpected behavior during system execution. One of the methods to prevent failures consists in testing a system under different input values, but when all possible input values are tested, an impractical number of test cases might result. In software testing, pair-wise testing is a combinatorial technique which uses combination of pair input values to generate test cases. Using pair-wise testing dramatically reduces the number of test cases, …