Solving large scale generalized assignment problems — An aggregation / disaggregation approach-Reference-Cited by-同舟云学术

Solving large scale generalized assignment problems — An aggregation / disaggregation approach

Published:1993-01 Issue:1 Volume:64 Page:103-114
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Hallefjord Åsa,Jörnsten Kurt O.,Värbrand Peter

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference18 articles.

1. An integer generalized transportation model for optimal job assignment in computer networks;Balachandran;Operations Research,1976

2. Barcia, P., and Jörnsten, K.O., “Variable splitting and constructive duality: A method for structured integer programming problems”, forthcoming in European Journal of Operational Research.

3. The capacitated Chinese postman problem. Part I: A heuristic algorithm;Benavent,1987

4. Lagrangean relaxations for a generalized assignment-type problem;Chalmet,1977

5. Entropifunktionens användning vid aggregering — en förstudie;Eberstål,1979

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Mathematical Formulation of the Component Assignment Problem in PCB Assembly Lines;Proceeding of Flexible Automation and Integrated Manufacturing 1998;2023

2. On the Tight Formation for Multi-agent Dynamical Systems;Agent and Multi-Agent Systems. Technologies and Applications;2012

3. Predictive Control for Tight Group Formation of Multi-Agent Systems*;IFAC Proceedings Volumes;2011-01

4. A Survey of the Generalized Assignment Problem and Its Applications;INFOR: Information Systems and Operational Research;2007-08

5. Using error bounds to compare aggregated generalized transportation models;Annals of Operations Research;2006-06-24