The branch and bound principle has long been established as an effective computational tool for solving mixed integer linear programming problems. This paper investigates the computational feasibility of branch and bound methods in solving convex nonlinear integer programming problems. The...

A multiobjective integer programming model is presented for allocating an area of land for development. The objectives considered in the allocation are cost, proximity to desirable and undesirable land features and the shape of the area. An interactive multiobjective optimization algorithm is...

This paper considers the problem of optimally locating multi-activity facilities whose activity compositions are also to be determined. It is assumed that there are fixed costs associated both with establishing facilities and with including specific activities at the locations. This problem is...

The passage of the Depository Institutions Deregulation and Monetary Control Act of 1980 has created a major change in the banking system of the United States, in that the Federal Reserve began charging for its check clearing and collection services September 1, 1981. The result from the passage...

Decomposable systems, decomposition and 0-1 integer programming techniques are reviewed relative to project selection problems. It is concluded that a heuristic procedure is a suitable way to handle such problems in organizational settings. A hierarchical multiperiod multidimensional model is...

Recently, Mulvey and Crowder (Mulvey, J., H. Crowder. 1979. Cluster analysis: an application of Lagrangian relaxation. Management Sci. 25 329--340.) suggested that the p-median problem might be useful for cluster analysis problems (where the goal is to group objects described by a vector of...

In this paper, oil spills occurring near shore in semienclosed waterways are viewed as emergency events. A partial set covering model, similar to those developed for firehouse location analysis, is applied to the problem of locating oil spill response equipment. The model includes both...

In the scheduling situation considered here, we are given a set of routes, each associated with a particular school. A single bus is assigned to each route, picking up the students and arriving at their school within a specified time window. The scheduling problem is to find the fewest buses...

A timetabling problem is formulated as a large integer linear programming problem in 0-1 variables. A solution method based on Lagrangean relaxation coupled with subgradient optimization is presented. The solution method also incorporates a branch and bound procedure which takes advantage of...

This paper focuses upon the maximization of labor productivity through selection of the optimal number, duration, and placement of rest breaks. It is demonstrated that resolution of the limited validity associated with previous models leads to a mixed-integer quadratic programming formulation of...