Probabilistic analysis of the generalised assignment problem

DOI10.1007/BF01581197zbMath0767.90052WikidataQ56324089 ScholiaQ56324089MaRDI QIDQ1196166

Martin Dyer, Alan M. Frieze

Publication date: 17 December 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

probabilistic analysisgeneralised assignment

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Boolean programming (90C09)

Related Items

Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches ⋮ Greedy approaches for a class of nonlinear generalized assignment problems ⋮ A probabilistic analysis of the multi-period single-sourcing problem ⋮ The generalized assignment problem with flexible jobs ⋮ On the integrality gap of binary integer programs with Gaussian data ⋮ On the integrality gap of binary integer programs with Gaussian data ⋮ A class of greedy algorithms for the generalized assignment problem ⋮ Typical values of extremal-weight combinatorial structures with independent symmetric weights

Cites Work

• Unnamed Item
• Unnamed Item
• A property of assignment type mixed integer linear programming problems
• Probabilistic Analysis of the Multidimensional Knapsack Problem
• A branch and bound algorithm for the generalized assignment problem
• Probability Inequalities for Sums of Bounded Random Variables