Abstract A new class of matching problems that models centralized college admissions via standardized tests is presented. The allocation mechanism that is used in real-life applications of this… Expand

The impossibility theorems that abound in the theory of social choice show that there can be no satisfactory method for electing and ranking in the context of the traditional, 700-year-old model.Expand

An actual truck delivery problem of general applicability is stated as an integer program. The successful computational performance of Gomory's "cutting plane" algorithm for a set of nine particular… Expand

In Majority Judgment, Michel Balinski and Rida Laraki argue that the traditional theory of social choice offers no acceptable solution to the problems of how to elect, to judge, or to rank. They find… Expand

This paper attempts to present the major methods, successful or interesting uses, and computational experience relating to integer or discrete programming problems.Expand

This paper formulates a fixed‐cost transportation problem as an integer program, describes some of its special properties, and suggests an approximate method of solution. Examples are given to… Expand

We show that the major results known for the marriage and university admissions problems — the one-to one and many-to-one stable matching problems — are shown to have equivalents in the general many- to-many setting.Expand

A number of axiomatic approaches have been developed to ascribe meanings to the statements: the real matrixf ∈ R and the integer matrixa are “proportional to” a given matrixp ≥ 0.Expand

The stable admissions polytope is a convex hull of the stable assignments of the university admissions problem that is described by a set of linear inequalities.Expand