Publisher Summary This chapter presents a great variety of practical problems that are
represented by a set of entities, each having an associated value, from which one or more …

Integer Programming with a Fixed Number of Variables | Mathematics of Operations Research
INFORMS.org Certified Analytics Professional INFORMS Connect Career Center INFORMS …

The paper presents an algorithm for solving Integer Programming problems whose running
time depends on the number n of variables as n O (n). This is done by reducing an n …

We consider the problem of sharing multiple copies of some resource among various tasks.
We introduce a new notion of temporal fairness based on proportionate progress, called P …

1 Introduction.-1.1. Purpose of the Investigation.-1.2. Methodology Used.-1.3. Structure of the
Book.-2 Cutting and Packing Problems as Geometric-Combinatoric Problems.-2.1. Basic …

Knapsack Problems are the simplest NP-hard problems in Combinatorial Optimization, as
they maximize an objective function subject to a single resource constraint. Several variants …

Recently much effort has been devoted to determining the computational complexity for a
variety of integer programming problems. In this paper a general integer programming …

A new way of computing the upper bound for the zero-one knapsack problem is presented,
substantially improving on Dantzig's approach. A branch and bound algorithm is proposed …

This paper is concerned with upper bounds for the well-known Pallet Loading Problem
(PLP), which is the problem of packing identical boxes into a rectangular pallet so as to …

Many computational problems have bene ted greatly from the study of the mathematical
structure underlying the problems. In linear programming, the simplex algorithm, duality …