Suchergebnisse - "binary quadratic programming"

Joint Power Allocation and Beam Scheduling in Beam-Hopping Satellites: A Two-Stage Framework with a Probabilistic Perspective

Autoren: Chen, Lin Wu, Linlong Lagunas, Eva et al.

Quelle: IEEE Transactions on Wireless Communications. 23(10):14685-14701

Schlagwörter: Satellites, Lighting, Satellite broadcasting, Resource management, Vectors, Payloads, Wireless communication, Energy minimization, power control, beam hopping, binary quadratic programming

Dateibeschreibung: print

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-364740
https://doi.org/10.1109/TWC.2024.3417707

The Next Generation of Beam Hopping Satellite Systems: Dynamic Beam Illumination with Selective Precoding

Autoren: Chen, Lin Ha, Vu Nguyen Lagunas, Eva et al.

Quelle: IEEE Transactions on Wireless Communications. 22(4):2666-2682

Schlagwörter: binary quadratic programming, Dynamic beam illumination, selective precoding, user scheduling

Dateibeschreibung: print

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-337554
https://doi.org/10.1109/TWC.2022.3213418

Inductive linearization for binary quadratic programs with linear constraints: a computational study

Autoren: Sven Mallach

Quelle: 4OR. 22:47-87

Schlagwörter: ddc:330, ddc:650, Linearization, Mixed-integer programming, Binary quadratic programming, Non-linear programming

Zugangs-URL: https://hdl.handle.net/10419/312515
https://hdl.handle.net/10419/317731

SOLVING THE DAYS-OFF SCHEDULING PROBLEM USING QUADRATIC PROGRAMMING WITH CIRCULANT MATRIX

Autoren: Vasile Moraru Daniela Istrati Sergiu Zaporojan

Quelle: Journal of Engineering Science (Chişinău), Vol XXIX, Iss 4, Pp 97-108 (2022)

Schlagwörter: circulant matrix, binary quadratic programming, convex relaxation, Electronic computers. Computer science, 0202 electrical engineering, electronic engineering, information engineering, scheduling problem, QA75.5-76.95, 02 engineering and technology, TA1-2040, Engineering (General). Civil engineering (General), 01 natural sciences, separable optimization, 0104 chemical sciences

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

A Second Order-Cone Programming Relaxation for Days-Off Scheduling Problem

Autoren: Istrati, D. Moraru, V.A. Zaporojan, S.I.

Quelle: Electronics, Communications and Computing (Editia 11)

Schlagwörter: style, days-off scheduling, binary quadratic programming, styling (key words)

Dateibeschreibung: application/pdf

Zugangs-URL: https://ibn.idsi.md/vizualizare_articol/155187
https://ibn.idsi.md/vizualizare_articol/154879

Dantzig–Wolfe reformulations for binary quadratic problems

Autoren: Ceselli, A. L('e)tocart, L. Traversi, E. et al.

Weitere Verfasser: Ceselli, A. L('e)tocart, L. Traversi, E. et al.

Quelle: Mathematical Programming Computation. 14:85-120

Schlagwörter: Binary quadratic programming, Decomposition methods, Quadratic convex reformulation, Column generation, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences

Dateibeschreibung: application/pdf

Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem

Autoren: Galli L. Martello S. Rey C. et al.

Quelle: European Journal of Operational Research. 291:871-882

Schlagwörter: Binary quadratic programming, Combinatorial optimization, Lagrangian relaxation, Quadratic multiple knapsack, Reformulation linearization technique, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Dateibeschreibung: application/pdf

Zugangs-URL: http://manuscript.elsevier.com/S0377221720309383/pdf/S0377221720309383.pdf
https://hdl.handle.net/11568/1063741
https://doi.org/10.1016/j.ejor.2020.10.047
https://www.sciencedirect.com/science/article/pii/S0377221720309383

Inductive linearization for binary quadratic programs with linear constraints

Autoren: Sven Mallach

Quelle: 4OR. 19:549-570

Schlagwörter: ddc:650, C09, 0211 other engineering and technologies, Linearization, Mixed-integer programming, 0102 computer and information sciences, 02 engineering and technology, Binary quadratic programming, 16. Peace & justice, 01 natural sciences, R01, C30, C05, C20, C10, C11, Non-linear programming

Zugangs-URL: https://link.springer.com/content/pdf/10.1007/s10288-020-00460-z.pdf
https://link.springer.com/content/pdf/10.1007/s10288-020-00460-z.pdf
https://link.springer.com/article/10.1007/s10288-020-00460-z
https://doi.org/10.1007/s10288-020-00460-z
https://hdl.handle.net/10419/288359

Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem

Autoren: Sven Mallach

Quelle: EURO Journal on Computational Optimization, Vol 11, Iss , Pp 100071- (2023)

Schlagwörter: Linear ordering problem, Betweenness problem, Facility layout problem, Mixed-integer programming, Binary quadratic programming, Applied mathematics. Quantitative methods, T57-57.97, Electronic computers. Computer science, QA75.5-76.95

Dateibeschreibung: electronic resource

Relation: http://www.sciencedirect.com/science/article/pii/S2192440623000151; https://doaj.org/toc/2192-4406

Zugangs-URL: https://doaj.org/article/7c51ff7161204eac8958a222e3211948

A Method for Binary Quadratic Programming with Circulant Matrix

Autoren: ISTRATI, Daniela MORARU, Vasile ZAPOROJAN, Sergiu

Schlagwörter: binary quadratic programming, circulant matrix, Fourier matrix, separable programming, relaxed problem

Dateibeschreibung: application/pdf

Relation: http://repository.utm.md/handle/5014/21847

Verfügbarkeit: http://repository.utm.md/handle/5014/21847
https://doi.org/10.52326/ic-ecco.2022/CS.01

Plane Section Curves on Surfaces of NCP Functions

Autoren: Shun-Wei Li Yu-Lin Chang Jein-Shan Chen

Quelle: Axioms, Vol 11, Iss 557, p 557 (2022)

Schlagwörter: NCP functions, section curves, convexity, differentiability, binary quadratic programming, Mathematics, QA1-939

Relation: https://www.mdpi.com/2075-1680/11/10/557; https://doaj.org/toc/2075-1680; https://doaj.org/article/322a370f49f04ac7a33d43309c2da5b0

Verfügbarkeit: https://doi.org/10.3390/axioms11100557
https://doaj.org/article/322a370f49f04ac7a33d43309c2da5b0

Membership testing for Bernoulli and tail-dependence matrices

Autoren: Daniel Krause Matthias Scherer Jonas Schwinn et al.

Weitere Verfasser: Daniel Krause Matthias Scherer Jonas Schwinn et al.

Quelle: Journal of Multivariate Analysis. 168:240-260

Schlagwörter: Bernoulli-compatible matrix, tail-dependence matrix, column generation, binary quadratic programming, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, ddc

Zugangs-URL: https://ideas.repec.org/a/eee/jmvana/v168y2018icp240-260.html
https://dblp.uni-trier.de/db/journals/ma/ma168.html#KrauseSSW18
https://www.sciencedirect.com/science/article/pii/S0047259X1730564X
https://mediatum.ub.tum.de/node?id=1378029
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/43166
https://doi.org/10.1016/j.jmva.2018.07.014
https://mediatum.ub.tum.de/1378029

QPLIB: a library of quadratic programming instances

Autoren: Furini F. Traversi E. Belotti P. et al.

Weitere Verfasser: Furini F. Traversi E. Belotti P. et al.

Quelle: Mathematical programming computation (Internet) 11 (2019): 237–265. doi:10.1007/s12532-018-0147-4
info:cnr-pdr/source/autori:Furini F.; Traversi E.; Belotti P.; Frangioni A.; Gleixner A.; Gould N.; Liberti L.; Lodi A.; Misener R.; Mittelmann H.; Sahinidis N.V.; Vigerske S.; Wiegele A./titolo:QPLIB: a library of quadratic programming instances/doi:10.1007%2Fs12532-018-0147-4/rivista:Mathematical programming computation (Internet)/anno:2019/pagina_da:237/pagina_a:265/intervallo_pagine:237–265/volume:11
Mathematical programming computation
(2018). doi:10.5281/zenodo.1412045
info:cnr-pdr/source/autori:Fabio Furini, Emiliano Traversi, Pietro Belotti, Antonio Frangioni, Ambros Gleixner, Nick Gould, Leo Liberti,Andrea Lodi, Ruth Misener, Hans Mittelmann, Nikolaos V. Sahinidis, Stefan Vigerske, Angelika Wiegele/titolo:QPLIB: A Library of Quadratic Programming Instances/doi:10.5281%2Fzenodo.1412045/rivista:Mathematical programming computation (Print)/anno:2018/pagina_da:/pagina_a:/intervallo_pagine:/volume

Schlagwörter: Technology, CONVEX REFORMULATION, 0211 other engineering and technologies, Mixed-Integer Quadratically Constrained Quadratic Programming, 02 engineering and technology, Quadratic programming, Binary quadratic programming, 01 natural sciences, DESIGN, [INFO]Computer Science [cs], GLOBAL OPTIMIZATION ALGORITHMS, POOLING PROBLEMS, 0101 mathematics, CUT APPROACH, Science & Technology, Operations Research & Management Science, SQP ALGORITHM, Instance library, PERSPECTIVE REFORMULATIONS, Probabilités et mathématiques appliquées, SEARCH ALGORITHM, Instance Library, Quadratic Programming, TRUST-REGION SUBPROBLEM, MINLP PROBLEMS

Dateibeschreibung: application/pdf

Zugangs-URL: https://arpi.unipi.it/bitstream/11568/930999/1/QPLIB.pdf
https://asu.pure.elsevier.com/en/publications/qplib-a-library-of-quadratic-programming-instances
http://mpc.zib.de/index.php/MPC/article/view/231/155
https://hal-polytechnique.archives-ouvertes.fr/hal-02177672v1
https://link.springer.com/article/10.1007/s12532-018-0147-4
https://dblp.uni-trier.de/db/journals/mpc/mpc11.html#FuriniTBFGGLLMM19
https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/6755
http://hdl.handle.net/10044/1/70377
https://link.springer.com/article/10.1007/s12532-018-0147-4
https://hdl.handle.net/11568/930999
https://doi.org/10.1007/s12532-018-0147-4
https://hdl.handle.net/11311/1163700
https://doi.org/10.1007/s12532-018-0147-4

On–Off Scheduling for Electric Vehicle Charging in Two-Links Charging Stations Using Binary Optimization Approaches

Autoren: Rafał Zdunek Andrzej Grobelny Jerzy Witkowski et al.

Quelle: Sensors, Vol 21, Iss 7149, p 7149 (2021)

Schlagwörter: electrical vehicles, EV charging scheduling, binary linear programming, binary quadratic programming, Chemical technology, TP1-1185

Relation: https://www.mdpi.com/1424-8220/21/21/7149; https://doaj.org/toc/1424-8220; https://doaj.org/article/cdcbce2fab2c496983cf5fcdc0ab858e

Verfügbarkeit: https://doi.org/10.3390/s21217149
https://doaj.org/article/cdcbce2fab2c496983cf5fcdc0ab858e

BiqCrunch: A Semidefinite Branch-and-Bound Method for Solving Binary Quadratic Problems

Autoren: Nathan Krislock Jérôme Malick Frédéric Roupin et al.

Weitere Verfasser: Nathan Krislock Jérôme Malick Frédéric Roupin et al.

Quelle: ACM Transactions on Mathematical Software. 43:1-23

Schlagwörter: Combinatorial optimization, Branch-and-bound, 0211 other engineering and technologies, Integer programming, 02 engineering and technology, Quadratic programming, NP-hard, Binary quadratic programming, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], quasi-Newton, exact resolution, semidefinite relaxations

Zugangs-URL: https://hal.archives-ouvertes.fr/hal-01486513/file/biqCrunch.pdf
https://hal.archives-ouvertes.fr/hal-01486513/file/biqCrunch.pdf
https://dblp.uni-trier.de/db/journals/toms/toms43.html#KrislockMR17
http://dblp.uni-trier.de/db/journals/toms/toms43.html#KrislockMR17
https://dl.acm.org/citation.cfm?id=3005345
https://hal.archives-ouvertes.fr/hal-01486513
https://dl.acm.org/doi/10.1145/3005345

A Low-Complexity High-Performance Preprocessing Algorithm for Multiuser Detection using Gold Sequences

Autoren: Axehill, Daniel Hansson, Anders Gunnarsson, Fredrik

Quelle: LiTH-ISY-R.

Schlagwörter: Code division multiple access, Computational complexity, Error statistics, Interference suppression, Maximum likelihood detection, Multiuser detection, Quadratic programming, Sequences, CDMA channel models, Gold sequences, NP-hard problem, Binary quadratic programming problem, Bit error rate, Low cross correlation, Low-complexity high-performance preprocessing algorithm, Maximum likelihood problem, Optimal detector, Optimum multiuser detection problem, Parallel interference cancellation, Suboptimal detector, Successive interference cancellation, Time-synchronous users, TECHNOLOGY, TEKNIKVETENSKAP

Dateibeschreibung: electronic

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-56156
https://liu.diva-portal.org/smash/get/diva2:316942/FULLTEXT01.pdf

An Efficient Maximization Algorithm With Implications in Min-Max Predictive Control

Autoren: Alamo, Teodoro Muñoz de la Peña Sequedo, David Camacho, Eduardo F. et al.

Weitere Verfasser: Alamo, Teodoro Muñoz de la Peña Sequedo, David Camacho, Eduardo F. et al.

Schlagwörter: Band matrices, Binary quadratic programming, Combinatorial optimization

Relation: IEEE Transactions on Automatic Control, 53 (9), 2192-2197.; https://ieeexplore.ieee.org/abstract/document/4639438; https://idus.us.es/handle//11441/94375

Verfügbarkeit: https://idus.us.es/handle//11441/94375

Modeling an Uncertain Productivity Learning Process Using an Interval Fuzzy Methodology

Autoren: Min-Chi Chiu Tin-Chih Toly Chen Keng-Wei Hsu

Quelle: Mathematics, Vol 8, Iss 998, p 998 (2020)

Schlagwörter: productivity, learning, interval fuzzy number, mixed binary quadratic programming, ordered weighted average, Mathematics, QA1-939

Relation: https://www.mdpi.com/2227-7390/8/6/998; https://doaj.org/toc/2227-7390; https://doaj.org/article/6894570f7b864c50a22e32f9fc07259a

Verfügbarkeit: https://doi.org/10.3390/math8060998
https://doaj.org/article/6894570f7b864c50a22e32f9fc07259a

A Preprocessing Algorithm Applicable to the Multiuser Detection Problem

Autoren: Axehill, Daniel Gunnarsson, Fredrik Hansson, Anders

Quelle: LiTH-ISY-R.

Schlagwörter: CDMA, Gold sequences, Multiuser detection, Polynomial complexity, Binary quadratic programming, TECHNOLOGY, Information technology, Automatic control, TEKNIKVETENSKAP, Informationsteknik, Reglerteknik

Dateibeschreibung: electronic

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-56045
https://liu.diva-portal.org/smash/get/diva2:316895/FULLTEXT01.pdf