An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks

DOI10.1287/OPRE.24.4.742MaRDI QIDQ4128239zbMATH OpenOpenAlexFDO

Authors V. K. Balachandran

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cited in

(20)

• An algorithm for the bottleneck generalized assignment problem
• A survey of algorithms for the generalized assignment problem
• Effective algorithm and heuristic for the generalized assignment problem.
• The equilibrium generalized assignment problem and genetic algorithm
• The generalized assignment problem: Valid inequalities and facets
• On a class of assignment problems.
• scientific article; zbMATH DE number 7525506 (Why is no real title available?)
• Lagrangean/surrogate relaxation for generalized assignment problems
• Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach
• Transformations Enlarging the Network Portion of a Class or LP/Embedded Generalized Networks
• Partage de taches entre processeurs homogenes
• A hybrid algorithm for the generalized assignment problem
• Generalized cover facet inequalities for the generalized assignment problem
• A class of greedy algorithms for the generalized assignment problem
• A set partitioning heuristic for the generalized assignment problem
• Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
• Time-dependent travelling salesman problem.
• On quadratic fractional generalized solid bi-criterion transportation problem
• Relaxation heuristics for a generalized assignment problem
• Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships

This page was built for publication: An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4128239)