An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
From MaRDI portal
(Redirected from Publication:4128239)
Cited in
(21)- Partage de taches entre processeurs homogenes
- A survey of algorithms for the generalized assignment problem
- An algorithm for the bottleneck generalized assignment problem
- Relaxation heuristics for a generalized assignment problem
- A set partitioning heuristic for the generalized assignment problem
- Effective algorithm and heuristic for the generalized assignment problem.
- A class of greedy algorithms for the generalized assignment problem
- Lagrangean/surrogate relaxation for generalized assignment problems
- On quadratic fractional generalized solid bi-criterion transportation problem
- On a class of assignment problems.
- Time-dependent travelling salesman problem.
- A hybrid algorithm for the generalized assignment problem
- Generalized cover facet inequalities for the generalized assignment problem
- Transformations Enlarging the Network Portion of a Class or LP/Embedded Generalized Networks
- The equilibrium generalized assignment problem and genetic algorithm
- Generalized assignment via submodular optimization with reserved capacity
- Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships
- Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach
- Investigation of a multi-objective fixed charge transportation problem with quantity dependent transportation cost and discount policy via metaheuristics
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
- The generalized assignment problem: Valid inequalities and facets
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)
