Suchergebnisse - "unconstrained binary quadratic programming"

On the effects of smoothing rugged landscape by different toy problems: A case study on UBQP

Autoren: Wang, Wei Shi, Jialong Sun, Jianyong et al.

Weitere Verfasser: Wang, Wei Shi, Jialong Sun, Jianyong et al.

Quelle: 2024 IEEE Congress on Evolutionary Computation (CEC)
CEC 2024 – IEEE Congress on Evolutionary Computation
https://hal.science/hal-04692908
CEC 2024 – IEEE Congress on Evolutionary Computation, Jun 2024, Yokohama, Japan. pp.1-8, ⟨10.1109/CEC60901.2024.10612165⟩

Schlagwörter: Unconstrained Binary Quadratic Programming, Landscape smoothing, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]

Geographisches Schlagwort: Yokohama, Japan

Verfügbarkeit: https://hal.science/hal-04692908
https://hal.science/hal-04692908v1/document
https://hal.science/hal-04692908v1/file/wang-cec2024.pdf
https://doi.org/10.1109/CEC60901.2024.10612165

SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances

Autoren: GRIPPO, Luigi PIACENTINI, Mauro PALAGI, Laura et al.

Weitere Verfasser: GRIPPO, Luigi PIACENTINI, Mauro PALAGI, Laura et al.

Quelle: Mathematical programming 136 (2012): 353–373. doi:10.1007/s10107-012-0593-0
info:cnr-pdr/source/autori:L. Grippo; L. Palagi; M. Piacentini; V. Piccialli; G. Rinaldi/titolo:SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances/doi:10.1007%2Fs10107-012-0593-0/rivista:Mathematical programming/anno:2012/pagina_da:353/pagina_a:373/intervallo_pagine:353–373/volume:136

Schlagwörter: Settore MAT/09 - RICERCA OPERATIVA, low rank factorization, 0211 other engineering and technologies, Semidefinite programming · Low rank factorization · Unconstrained binary quadratic programming · Max-Cut · Nonlinear programming, Semidefinite programming, 02 engineering and technology, Semidefinite programming, low rank factorization, unconstrained binary quadratic programming, max-cut, nonlinear programming, semidefinite programming, unconstrained binary quadratic programming

Dateibeschreibung: application/pdf

Zugangs-URL: https://www.infona.pl/resource/bwmeta1.element.springer-f1e8d3fb-45ff-393f-bc41-84ce78c211f5
https://link.springer.com/article/10.1007%2Fs10107-012-0593-0
https://doi.org/10.1007/s10107-012-0593-0
https://dblp.uni-trier.de/db/journals/mp/mp136.html#GrippoPPPR12
https://core.ac.uk/display/53849770
https://moh-it.pure.elsevier.com/en/publications/speedp-an-algorithm-to-compute-sdp-bounds-for-very-large-max-cut-
https://hdl.handle.net/20.500.14243/229542
https://doi.org/10.1007/s10107-012-0593-0

Using Parallel Strategies to Speed Up Pareto Local Search

Autoren: Shi, Jialong Zhang, Qingfu Derbel, Bilel et al.

Weitere Verfasser: Shi, Jialong Zhang, Qingfu Derbel, Bilel et al.

Quelle: SEAL 2017 : The 11th International Conference on Simulated Evolution and Learning ; 11th International Conference on Simulated Evolution and Learning (SEAL 2017) ; https://hal.science/hal-01581257 ; 11th International Conference on Simulated Evolution and Learning (SEAL 2017), Nov 2017, Shenzhen, China ; http://www.seal2017.com

Schlagwörter: multiobjective combinatorial optimization, Pareto local, search, parallel metaheuristics, unconstrained binary quadratic programming, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]

Geographisches Schlagwort: Shenzhen, China

Verfügbarkeit: https://hal.science/hal-01581257
https://hal.science/hal-01581257v1/document
https://hal.science/hal-01581257v1/file/shi.seal2017.pdf

A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming

Autoren: Liefooghe, Arnaud Verel, Sébastien Hao, Jin-Kao et al.

Weitere Verfasser: Liefooghe, Arnaud Verel, Sébastien Hao, Jin-Kao et al.

Quelle: Applied Soft Computing. 16:10-19

Schlagwörter: Unconstrained binary quadratic programming, Hybrid Metaheuristic, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, Multiobjective combinatorial optimization, Evolutionary Multiobjective Optimization, 02 engineering and technology, Scalarizing function, Tabu search, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC]

Dateibeschreibung: application/pdf

Zugangs-URL: http://hal.inria.fr/docs/00/82/95/00/PDF/hybrid-mubqp.pdf
https://hal.science/hal-00801793v3
https://hal.science/hal-00801793v3/document
https://doi.org/10.1016/j.asoc.2013.11.008
https://hal.archives-ouvertes.fr/hal-00801793
https://www.sciencedirect.com/science/article/pii/S1568494613004079
http://www.info.univ-angers.fr/pub/hao/papers/ASCLiefooghe.pdf
http://okina.univ-angers.fr/publications/ua7064
https://dl.acm.org/doi/10.1016/j.asoc.2013.11.008
https://dblp.uni-trier.de/db/journals/asc/asc16.html#LiefoogheVH14

On the Approximate Solution of a Class of Large Discrete Quadratic Programming Problems by $\Delta\Sigma$ Modulation: The Case of Circulant Quadratic Forms

Autoren: CALLEGARI, SERGIO F. Bizzarri ROVATTI, RICCARDO et al.

Quelle: IEEE Transactions on Signal Processing. 58:6126-6139

Schlagwörter: 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, UNCONSTRAINED BINARY QUADRATIC PROGRAMMING, CIRCULANT MATRIX, DELTA-SIGMA MODULATOR, Approximation, delta-sigma modulation, integer programming, optimization, sezele, 02 engineering and technology

Dateibeschreibung: application/pdf

Zugangs-URL: https://re.public.polimi.it/handle/11311/578924
http://ieeexplore.ieee.org/document/5560887/
https://ieeexplore.ieee.org/document/5560887/
http://ui.adsabs.harvard.edu/abs/2010ITSP...58.6126C/abstract
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005560887
https://www.infona.pl/resource/bwmeta1.element.ieee-art-000005560887
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5560887
https://doi.org/10.1109/TSP.2010.2071866
https://hdl.handle.net/11311/578924

Using Parallel Strategies to Speed up Pareto Local Search

Autoren: Sébastien Verel Arnaud Liefooghe Jialong Shi et al.

Weitere Verfasser: Sébastien Verel Arnaud Liefooghe Jialong Shi et al.

Quelle: Lecture Notes in Computer Science ISBN: 9783319687582

Schlagwörter: search, multiobjective combinatorial optimization, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], Pareto local, parallel metaheuristics, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], unconstrained binary quadratic programming

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal.archives-ouvertes.fr/hal-01581257/file/shi.seal2017.pdf
https://hal.science/hal-01581257v1
https://hal-univ-tlse3.archives-ouvertes.fr/EC-LILLE/hal-01581257v1
https://hal.archives-ouvertes.fr/hal-01581257
https://rd.springer.com/chapter/10.1007/978-3-319-68759-9_6
https://hal.archives-ouvertes.fr/hal-01581257/document
https://link.springer.com/chapter/10.1007%2F978-3-319-68759-9_6
https://dblp.uni-trier.de/db/conf/seal/seal2017.html#ShiZDLV17

Automatic algorithm configuration : methods and applications ; Configuração automática de algoritmos: métodos e aplicações

Autoren: Souza, Marcelo de Ritt, Marcus Rolf Peter

Weitere Verfasser: Souza, Marcelo de Ritt, Marcus Rolf Peter

Schlagwörter: Automatic algorithm configuration, Automatic algorithm design, Parameter tuning, Capping methods, Parameter regression models, Unconstrained binary quadratic programming, Algoritmos, Configuração automática de algoritmos

Dateibeschreibung: application/pdf

Relation: http://hdl.handle.net/10183/236350; 001138869

Verfügbarkeit: http://hdl.handle.net/10183/236350

A Hybrid Metaheuristic for Multiobjective Unconstrained Binary Quadratic Programming

Autoren: Arnaud Liefooghe Sébastien Verel B Jin-kao Hao D et al.

Weitere Verfasser: Arnaud Liefooghe Sébastien Verel B Jin-kao Hao D et al.

Quelle: http://hal.inria.fr/docs/00/82/95/00/PDF/hybrid-mubqp.pdf.

Schlagwörter: Key words, Unconstrained binary quadratic programming, Multiobjective combinatorial optimization, Hybrid Metaheuristic, Evolutionary Multiobjective Optimization, Tabu search, Scalarizing function

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.398.4455

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.398.4455
http://hal.inria.fr/docs/00/82/95/00/PDF/hybrid-mubqp.pdf

Perturbation Based Search Method for Solving Unconstrained Binary Quadratic Programming Problem

Autoren: Muthu Solayappan Kien Ming Ng Kim Leng Poh

Schlagwörter: unconstrained binary quadratic programming, perturbation, interior point methods

Relation: https://zenodo.org/communities/waset/; https://zenodo.org/records/1081850; oai:zenodo.org:1081850; https://doi.org/10.5281/zenodo.1081850

Verfügbarkeit: https://doi.org/10.5281/zenodo.1081850
https://zenodo.org/records/1081850

A heuristic solution to the optimisation of flutter control in compression systems (and to some more binary quadratic programming problems) via ∆Σ modulation circuits

Autoren: BIZZARRI, FEDERICO CALLEGARI, SERGIO

Schlagwörter: UNCONSTRAINED BINARY QUADRATIC PROGRAMMING, DELTA-SIGMA MODULATION, HEURISTIC OPTIMIZATION

Zugangs-URL: https://hdl.handle.net/11585/97432

Memetic Algorithms for the Unconstrained Binary Quadratic Programming Problem

Autoren: Peter Merz Kengo Katayama The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Peter Merz Kengo Katayama The Pennsylvania State University CiteSeerX Archives

Quelle: http://www-ra.informatik.uni-tuebingen.de/mitarb/pmerz/papers/bs-bqp.ps.gz.

Schlagwörter: Unconstrained Binary Quadratic Programming Problem, Fitness Landscape Analysis, Evolutionary Algorithm, Local Search, Combinatorial Optimization

Dateibeschreibung: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.6624

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.6624
http://www-ra.informatik.uni-tuebingen.de/mitarb/pmerz/papers/bs-bqp.ps.gz

[en] AN IMPROVED EXACT METHOD FOR THE UBQP

[pt] UM MÉTODO EXATO MELHORADO PARA O UBQP

Autoren: DANIEL FLEISCHMAN

Thesis Advisors: MARCUS VINICIUS SOLEDADE POGGI DE ARAGAO

Schlagwörter: [pt] SEMIDEFINITE PROGRAMMING, [pt] BRANCH-AND-BOUND, [pt] UNCONSTRAINED BINARY QUADRATIC PROGRAMMING

Verfügbarkeit: https://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=17054@1
https://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=17054@2

A Hybrid Metaheuristic for Multiobjective Unconstrained Binary Quadratic Programming

Autoren: Arnaud Liefooghe Jin-kao Haod The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Arnaud Liefooghe Jin-kao Haod The Pennsylvania State University CiteSeerX Archives

Quelle: http://hal.univ-lille3.fr/docs/00/90/46/91/PDF/hybrid-mubqp-r2.pdf.

Schlagwörter: Key words, Unconstrained binary quadratic programming, Multiobjective combinatorial optimization, Hybrid Metaheuristic, Evolutionary Multiobjective Optimization, Tabu search, Scalarizing function

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.634.9988

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.634.9988
http://hal.univ-lille3.fr/docs/00/90/46/91/PDF/hybrid-mubqp-r2.pdf