An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
From MaRDI portal
Publication:4128239
DOI10.1287/opre.24.4.742zbMath0356.90028OpenAlexW2058324360MaRDI QIDQ4128239
Publication date: 1976
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.kellogg.northwestern.edu/research/math/papers/58.pdf
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)
Related Items (20)
Transformations Enlarging the Network Portion of a Class or LP/Embedded Generalized Networks ⋮ Lagrangian relaxation guided problem space search heuristics for generalized assignment problems ⋮ The equilibrium generalized assignment problem and genetic algorithm ⋮ The generalized assignment problem: Valid inequalities and facets ⋮ Effective algorithm and heuristic for the generalized assignment problem. ⋮ Partage de taches entre processeurs homogenes ⋮ Generalized cover facet inequalities for the generalized assignment problem ⋮ On a class of assignment problems. ⋮ Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach ⋮ A survey of algorithms for the generalized assignment problem ⋮ Time-dependent travelling salesman problem. ⋮ Unnamed Item ⋮ Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships ⋮ A hybrid algorithm for the generalized assignment problem ⋮ An algorithm for the bottleneck generalized assignment problem ⋮ Lagrangean/surrogate relaxation for generalized assignment problems ⋮ Relaxation heuristics for a generalized assignment problem ⋮ A class of greedy algorithms for the generalized assignment problem ⋮ On quadratic fractional generalized solid bi-criterion transportation problem ⋮ A set partitioning heuristic for the generalized assignment problem
This page was built for publication: An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
