We prove, for various input distributions, that the number of dominating solutions (i.e., Pareto-optimal knapsack fillings) to this problem is polynomially bounded in number of available items.Expand

We present a probabilistic analysis of a large class of combinatorial optimization problems containing all binary optimization problems defined by linear constraints and a linear objective function over $\{0,1\}^n$.Expand

We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers.Expand

An algorithm for solving a classic optimization problem – how best to pack a knapsack for hike, taking into account the weight and the associated profit of each object carried.Expand

A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind of dynamic programming approach.Expand

We present the first average-case analysis proving a polynomial upper bound on the expected running time of an exact algorithm for the 0/1 knapsack problem.Expand