A note on the assignment problem with seniority and job priority constraints

Article Abstract:

It is proved that the assignment problem with priority constraints can be solved by successively reoptimizing a linear assignment problem of increasing size. The approach is shown to be easy to modify to solve the problem under the bottleneck criterion.

Analysis, Linear programming, Tests, problems and exercises, Problem solving, Job security

---

A comparison of genetic and conventional methods for the solution of integer goal programmes

Article Abstract:

Two different approaches to solving the difficult Goal Programming models are discussed. The development of an integer Goal Programming solver is described.

---

A note on splitting of variables in integer programming models

Article Abstract:

A modification is presented to the splitting of variables in an integer programming model.

Variables (Mathematics)

Similar abstracts:

• Abstracts: Adopting a green approach: environmental issues form an integral part of runway construction. Compact solution
• Abstracts: EBRD's new president pledges he won't seek major policy changes. German debt dominates issuance
• Abstracts: Solving the generalized apportionment problem through the optimization of discrepancy functions. Note on cyclic sequences in the product rate variation problem
• Abstracts: Industrial linear optimization problems solved by constraint logic programming. Establishing dominance between alternatives with incomplete information in a hierarchically structured attribute tree
• Abstracts: An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts. Expected utility maximization of optimal stopping problems

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