A Reduced Semidefinite Programming Formulation for HA Assignment Problems in Sport Scheduling
Autor(a) principal: | |
---|---|
Data de Publicação: | 2018 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | TEMA (Sociedade Brasileira de Matemática Aplicada e Computacional. Online) |
Texto Completo: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S2179-84512018000300471 |
Resumo: | ABSTRACT Home-Away Assignment problems are naturally considered as quadratic programming models in binary variables. For solving the problem, different formulations are studied here. First, the problem is rewritten as a quadratic programming formulation with linear constraints, and a quadratically constrained version respectively. For large scale problem, some reduced formulation are proposed by manipulating their special structure, with 1/4 of the original size. Note that the quadratic programming formulations lead to semidefinite relaxations solved approximately by semidefinite programming method. Comparison between our SDP relaxation and the MIN-RES-CUT based formulation is given. Finally some numerical experiments are given to illustrate the characteristics of each model. |
id |
SBMAC-1_0fa355d6a27bb2c5fdf993e3802abe63 |
---|---|
oai_identifier_str |
oai:scielo:S2179-84512018000300471 |
network_acronym_str |
SBMAC-1 |
network_name_str |
TEMA (Sociedade Brasileira de Matemática Aplicada e Computacional. Online) |
repository_id_str |
|
spelling |
A Reduced Semidefinite Programming Formulation for HA Assignment Problems in Sport SchedulingSports schedulingInteger quadratic programmingSemidefinite programmingABSTRACT Home-Away Assignment problems are naturally considered as quadratic programming models in binary variables. For solving the problem, different formulations are studied here. First, the problem is rewritten as a quadratic programming formulation with linear constraints, and a quadratically constrained version respectively. For large scale problem, some reduced formulation are proposed by manipulating their special structure, with 1/4 of the original size. Note that the quadratic programming formulations lead to semidefinite relaxations solved approximately by semidefinite programming method. Comparison between our SDP relaxation and the MIN-RES-CUT based formulation is given. Finally some numerical experiments are given to illustrate the characteristics of each model.Sociedade Brasileira de Matemática Aplicada e Computacional2018-12-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S2179-84512018000300471TEMA (São Carlos) v.19 n.3 2018reponame:TEMA (Sociedade Brasileira de Matemática Aplicada e Computacional. Online)instname:Sociedade Brasileira de Matemática Aplicada e Computacionalinstacron:SBMAC10.5540/tema.2018.019.03.0471info:eu-repo/semantics/openAccessLARA,H. J.SIQUEIRA,A.S.YUAN,J.eng2018-12-13T00:00:00Zoai:scielo:S2179-84512018000300471Revistahttp://www.scielo.br/temaPUBhttps://old.scielo.br/oai/scielo-oai.phpcastelo@icmc.usp.br2179-84511677-1966opendoar:2018-12-13T00:00TEMA (Sociedade Brasileira de Matemática Aplicada e Computacional. Online) - Sociedade Brasileira de Matemática Aplicada e Computacionalfalse |
dc.title.none.fl_str_mv |
A Reduced Semidefinite Programming Formulation for HA Assignment Problems in Sport Scheduling |
title |
A Reduced Semidefinite Programming Formulation for HA Assignment Problems in Sport Scheduling |
spellingShingle |
A Reduced Semidefinite Programming Formulation for HA Assignment Problems in Sport Scheduling LARA,H. J. Sports scheduling Integer quadratic programming Semidefinite programming |
title_short |
A Reduced Semidefinite Programming Formulation for HA Assignment Problems in Sport Scheduling |
title_full |
A Reduced Semidefinite Programming Formulation for HA Assignment Problems in Sport Scheduling |
title_fullStr |
A Reduced Semidefinite Programming Formulation for HA Assignment Problems in Sport Scheduling |
title_full_unstemmed |
A Reduced Semidefinite Programming Formulation for HA Assignment Problems in Sport Scheduling |
title_sort |
A Reduced Semidefinite Programming Formulation for HA Assignment Problems in Sport Scheduling |
author |
LARA,H. J. |
author_facet |
LARA,H. J. SIQUEIRA,A.S. YUAN,J. |
author_role |
author |
author2 |
SIQUEIRA,A.S. YUAN,J. |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
LARA,H. J. SIQUEIRA,A.S. YUAN,J. |
dc.subject.por.fl_str_mv |
Sports scheduling Integer quadratic programming Semidefinite programming |
topic |
Sports scheduling Integer quadratic programming Semidefinite programming |
description |
ABSTRACT Home-Away Assignment problems are naturally considered as quadratic programming models in binary variables. For solving the problem, different formulations are studied here. First, the problem is rewritten as a quadratic programming formulation with linear constraints, and a quadratically constrained version respectively. For large scale problem, some reduced formulation are proposed by manipulating their special structure, with 1/4 of the original size. Note that the quadratic programming formulations lead to semidefinite relaxations solved approximately by semidefinite programming method. Comparison between our SDP relaxation and the MIN-RES-CUT based formulation is given. Finally some numerical experiments are given to illustrate the characteristics of each model. |
publishDate |
2018 |
dc.date.none.fl_str_mv |
2018-12-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S2179-84512018000300471 |
url |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S2179-84512018000300471 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
10.5540/tema.2018.019.03.0471 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
text/html |
dc.publisher.none.fl_str_mv |
Sociedade Brasileira de Matemática Aplicada e Computacional |
publisher.none.fl_str_mv |
Sociedade Brasileira de Matemática Aplicada e Computacional |
dc.source.none.fl_str_mv |
TEMA (São Carlos) v.19 n.3 2018 reponame:TEMA (Sociedade Brasileira de Matemática Aplicada e Computacional. Online) instname:Sociedade Brasileira de Matemática Aplicada e Computacional instacron:SBMAC |
instname_str |
Sociedade Brasileira de Matemática Aplicada e Computacional |
instacron_str |
SBMAC |
institution |
SBMAC |
reponame_str |
TEMA (Sociedade Brasileira de Matemática Aplicada e Computacional. Online) |
collection |
TEMA (Sociedade Brasileira de Matemática Aplicada e Computacional. Online) |
repository.name.fl_str_mv |
TEMA (Sociedade Brasileira de Matemática Aplicada e Computacional. Online) - Sociedade Brasileira de Matemática Aplicada e Computacional |
repository.mail.fl_str_mv |
castelo@icmc.usp.br |
_version_ |
1752122220535087104 |