Close

1. Identity statement
Reference TypeJournal Article
Sitemtc-m16.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Identifier6qtX3pFwXQZsFDuKxG/DbL2M
Repositorysid.inpe.br/marciana/2004/08.17.14.34   (restricted access)
Last Update2004:08.17.03.00.00 (UTC) administrator
Metadata Repositorysid.inpe.br/marciana/2004/08.17.14.34.43
Metadata Last Update2018:06.05.01.28.42 (UTC) administrator
Secondary KeyINPE-11220-PRE/6669
ISBN/ISSN0377-2217
ISSN0377-2217
Citation KeyLorenaNarc:1996:ReHeGe
TitleRelaxation heuristics for a generalized assignment problem
ProjectOtimização combinatória
Year1996
MonthJune
Access Date2024, Apr. 28
Secondary TypePRE PI
Number of Files1
Size546 KiB
2. Context
Author1 Lorena, Luiz Antonio Nogueira
2 Narciso, M. G.
Resume Identifier1 8JMKD3MGP5W/3C9JHMQ
Group1 LAC-INPE-MCT-BR
Affiliation1 Instituto Nacional de Pesquisas Espaciais, Laboratório Associado de Computação e Matemática Aplicada (INPE.LAC)
JournalEuropean Journal of Operational Research
Volume91
Number3
Pages600-610
History (UTC)2005-06-13 12:41:06 :: sergio -> administrator ::
2006-09-28 22:36:23 :: administrator -> sergio ::
2008-01-07 12:49:57 :: sergio -> administrator ::
2018-06-05 01:28:42 :: administrator -> marciana :: 1996
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
KeywordsCOMPUTER SCIENCE
Lagrangian function
Heuristic methods
Relaxation method (mathematics)
COMPUTAÇÃO APLICADA
Função lagrangiana
Métodos heurísticos
Método de relaxação (matemática)
AbstractWe propose relaxation heuristics for the problem of maximum profit assignment of n tasks to m agents (n > m), such that each task is assigned to only one agent subject to capacity constraints on the agents. Using Lagrangian or surrogate relaxation, the heuristics perform a subgradient search obtaining feasible solutions. Relaxation considers a vector of multipliers for the capacity constraints. The resolution of the Lagrangian is then immediate. For the surrogate, the resulting problem is a multiple choice knapsack that is again relaxed for continuous values of the variables, and solved in polynomial time. Relaxation multipliers are used with an improved heuristic of Martello and Toth or a new constructive heuristic to find good feasible solutions. Sh heuristics are tested with problems of the literature and random generated problems. Best results are less than 0.5% from the optimal, with reasonable computational times for an AT/386 computer. It seems promising even for problems with correlated coefficients.
AreaCOMP
Arrangementurlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > Relaxation heuristics for...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
Languageen
Target Filerelaxation heuristics.pdf
User Groupadministrator
sergio
Visibilityshown
Copy HolderSID/SCD
Archiving Policydenypublisher denyfinaldraft36
Read Permissiondeny from all and allow from 150.163
5. Allied materials
Next Higher Units8JMKD3MGPCW/3ESGTTP
DisseminationWEBSCI; PORTALCAPES.
Host Collectionsid.inpe.br/banon/2003/08.15.17.40
6. Notes
Empty Fieldsalternatejournal archivist callnumber copyright creatorhistory descriptionlevel documentstage doi e-mailaddress electronicmailaddress format isbn label lineage mark mirrorrepository nextedition notes orcid parameterlist parentrepositories previousedition previouslowerunit progress readergroup rightsholder schedulinginformation secondarydate secondarymark session shorttitle sponsor subject tertiarymark tertiarytype typeofwork url versiontype
7. Description control
e-Mail (login)marciana
update 


Close