http://www.tu-ilmenau.de

Logo TU Ilmenau



Foto des Ansprechpartners
Ansprechpartner

Prof. Dr. rer. nat. habil. Matthias Kriesell

Institutsdirektor

Telefon +49 3677 69-3633

E-Mail senden


Ihre Position

INHALTE

Veröffentlichungen

Veröffentlichungen am Institut für Mathematik seit 1990

Anzahl der Treffer: 1141
Erstellt: Tue, 16 Jul 2019 23:05:03 +0200 in 0.0403 sec


Harant, Jochen; Fabrici, Igor; Jendrol', Stanislav;
On longest cycles in essentially 4-connected planar graphs. - In: Electronic notes in discrete mathematics - Amsterdam : Elsevier Science, ISSN 15710653, Bd. 55 (2016), S. 143-146

https://doi.org/10.1016/j.endm.2016.10.036
Shkalikov, A. A.; Trunk, Carsten;
On stability of closedness and self-adjointness for 2 x 2 operator matrices. - In: Mathematical notes - Dordrecht [u.a.] : Springer Science + Business Media B.V, ISSN 1573-8876, Bd. 100 (2016), 5, S. 870-875

http://dx.doi.org/10.1134/S0001434616110274
Braun, Philipp; Grüne, Lars; Kellett, Christopher M.; Weller, Steven R.; Worthmann, Karl;
A distributed optimization algorithm for the predictive control of smart grids. - In: IEEE transactions on automatic control - New York, NY : Institute of Electrical and Electronics Engineers, ISSN 1558-2523, Bd. 61 (2016), 12, S. 3898-3911

https://doi.org/10.1109/TAC.2016.2525808
Niebling, Julia; Eichfelder, Gabriele;
A branch-and-bound algorithm for bi-objective problems. - In: Proceedings of the XIII Global Optimization Workshop : GOW'16, 4-8 September 2016, University of Minho, Braga, Portugal. - Braga, Portugal : University of Minho, ISBN 978-989-20-6764-3, (2016), S. 57-60

An improved discarding test for a branch-and-bound algorithm for box-constrained bi-objective optimization problems is presented. The aim of the algorithm is to compute a covering of all global optimal solutions. We introduce the algorithm which uses selection, discarding and termination tests. The discarding tests are the most important aspect, because they examine in different ways whether a box can contain optimal solutions. For this, we are using the alphaBB-method from global scalar optimization and present and discuss an improved test compared to those from the literature.



http://hdl.handle.net/1822/42944
Eichfelder, Gabriele; Pilecka, Maria;
Set approach for set optimization with variable ordering structures : part II: scalarization approaches. - In: Journal of optimization theory and applications - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1573-2878, Bd. 171 (2016), 3, S. 947-963

http://dx.doi.org/10.1007/s10957-016-0993-z
Eichfelder, Gabriele; Pilecka, Maria;
Set approach for set optimization with variable ordering structures : part I: set relations and relationship to vector approach. - In: Journal of optimization theory and applications - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1573-2878, Bd. 171 (2016), 3, S. 931-946

http://dx.doi.org/10.1007/s10957-016-0992-0
Alt, Helmut; Payne, Michael S.; Schmidt, Jens M.; Wood, David R.;
Thoughts on Barnette's conjecture. - In: The Australasian journal of combinatorics - Queensland : Centre for Discrete Mathematics and Computing, Univ. of Queensland, ISSN 10344942, Bd. 64 (2016), S. 354-365

http://nbn-resolving.de/urn:nbn:de:gbv:ilm1-2016200298
Babovsky, Hans;
Discrete velocity models: bifurcations, hydrodynamic limits and application to an evaporation condensation problem. - In: AIP conference proceedings - Melville, NY : Inst, ISSN 15517616, Bd. 1786 (2016), S. 070005, insges. 6 S.

http://dx.doi.org/10.1063/1.4967581
Babovsky, Hans; Grabmeier, Johannes;
Calculus and design of discrete velocity models using computer algebra. - In: AIP conference proceedings - Melville, NY : Inst, ISSN 15517616, Bd. 1786 (2016), S. 180003, insges. 8 S.

http://dx.doi.org/10.1063/1.4967672
Schmidt, Jens M.;
Mondshein sequences (a.k.a. (2,1)-orders). - In: SIAM journal on computing : a publication of the Society for Industrial and Applied Mathematics. - Philadelphia, Pa : SIAM, ISSN 1095-7111, Bd. 45 (2016), 6, S. 1985-2003

http://dx.doi.org/10.1137/15M1030030