Lower bounds for the quadratic semi-assignment problem
AbstractNo abstract is available for this item.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 83 (1995)
Issue (Month): 2 (June)
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Domschke, Wolfgang & Forst, P. & Voß, S., 1992. "Tabu search techniques for the quadratic semiassignment problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 36424, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
- Chretienne, Philippe, 1989. "A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints," European Journal of Operational Research, Elsevier, vol. 43(2), pages 225-230, November.
- Malucelli, Federico, 1996. "A polynomially solvable class of quadratic semi-assignment problems," European Journal of Operational Research, Elsevier, vol. 91(3), pages 619-622, June.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.