Column generation applied to linear programs in course registration

Article Abstract:

The feasibility of using column generation to solve a large linear program that develops in the bidding system of University of Chicago's Graduate Business School during student registration is evaluated. A basic algorithm that uses a basis-crashing procedure and a judicious selection technique is used in the study. Results show that the proposed algorithm for column generation is capable of reducing computation time considerably.

Colleges & Universities, Colleges, Universities, and Professional Schools, Colleges and universities, Analysis, Linear programming, Innovations, Universities and colleges, Information management, Algorithms, University of Chicago

---

On solving large instances of the capacitated facility location problem

Article Abstract:

An integer programming method is developed using polyhedral approaches to solve capacitated facility location problem. The proposed methodology solves customer aggregation problems.

---

On solving large instances of the capacitated facility location problem

Article Abstract:

An integer programming method is developed using polyhedral approaches to solve capacitated facility location problem. The proposed methodology solves customer aggregation problems.

Similar abstracts:

• Abstracts: Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem. Stability analysis of an optimal balance for an assembly line with fixed cycle time
• Abstracts: Backtracking of jobs in one-dimensional machine location problems. Optimal models for a multi-stage supply chain system controlled by kanban under just-in-time philosophy
• Abstracts: Issues in the implementation of the DSD algorithm for the traffic assignment problem. A continuous whole-link travel time model with occupancy constraint
• Abstracts: A numerical study of some modified differential evolution algorithms. The KarushuKuhnuTucker optimality conditions in an optimization problem with interval-valued objective function
• Abstracts: Landscape-level optimization using tabu search and stand density-related forest management prescriptions. A constrained optimization approach to solving certain systems of convex equations

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.