Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Hans Mittelmann"'
Autor:
Loay Alkhalifa, Hans Mittelmann
Publikováno v:
Mathematics, Vol 10, Iss 2, p 198 (2022)
Techniques and methods of linear optimization underwent a significant improvement in the 20th century which led to the development of reliable mixed integer linear programming (MILP) solvers. It would be useful if these solvers could handle mixed int
Externí odkaz:
https://doaj.org/article/937fbb4e56144187b960137733a12dba
Publikováno v:
Entropy, Vol 20, Iss 4, p 269 (2018)
Bounds are developed on the maximum communications rate between a transmitter and a fusion node aided by a cluster of distributed receivers with limited resources for cooperation, all in the presence of an additive Gaussian interferer. The receivers
Externí odkaz:
https://doaj.org/article/380b84e4053144eea0f698509dc259e9
Publikováno v:
Mathematical Modelling and Analysis, Vol 17, Iss 3 (2012)
We describe the search for explicit general linear methods in Nordsieck form for which the stability function has only two nonzero roots. This search is based on state-of-the-art optimization software. Examples of methods found in this way are given
Externí odkaz:
https://doaj.org/article/928d8ef7ea274fada20df431064e736c
Autor:
Farnaz Safdarian, Jonathan Snodgrass, Ju Hee Yeo, Adam Birchfield, Carleton Coffrin, Chris Demarco, Stephen Elbert, Brent Eldridge, Tarek Elgindy, Scott L Greene, Nongchao Guo, Jesse Holzer, Bernard Lesieutre, Hans Mittelmann, Richard P O'Neill, Thomas J. Overbye, Bryan Palmintier, Pascal Van Hentenryck, Arun Veeramany, Terrence W.K. Mak, Jessica Wert
Publikováno v:
2022 North American Power Symposium (NAPS).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d598f7e8265c152444afd6b292631cdb
https://doi.org/10.1109/naps56150.2022.10012138
https://doi.org/10.1109/naps56150.2022.10012138
Autor:
Hans Mittelmann, Jiming Peng
Publikováno v:
SIAM Journal on Optimization. 20:3408-3426
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and facility locations and are known to be among the hardest discrete optim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::73a8a7dd2c565a8f8642a52f71bb00a5
https://doi.org/10.1137/090748834
https://doi.org/10.1137/090748834
Publikováno v:
AIP Conference Proceedings.
In the paper we consider the quadratic assignment problem arising from channel coding in communications where one coefficient matrix is the adjacency matrix of a hypercube in a finite dimensional space. By using the geometric structure of the hypercu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9814cc283df62d355e075b793b3de7b
https://doi.org/10.1063/1.3183570
https://doi.org/10.1063/1.3183570