Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Jonas Witt"'
Autor:
Marco E. Lübbecke, Jonas Witt
Publikováno v:
Discrete Optimization. 30:168-187
Dantzig–Wolfe reformulation of an integer program convexifies a subset of the constraints, which yields an extended formulation with a potentially stronger linear programming (LP) relaxation. We would like to better understand the strength of such
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4b381988024324fda3ccc563203e075d
https://doi.org/10.1016/j.disopt.2018.07.001
https://doi.org/10.1016/j.disopt.2018.07.001
Publikováno v:
Mathematical Programming
Mathematical Programming, Springer Verlag, 2017, ⟨10.1007/s10107-017-1168-x⟩
Mathematical Programming, 2017, ⟨10.1007/s10107-017-1168-x⟩
Mathematical Programming, Springer Verlag, 2017, ⟨10.1007/s10107-017-1168-x⟩
Mathematical Programming, 2017, ⟨10.1007/s10107-017-1168-x⟩
Even and odd pairs are important tools in the study of perfect graphs and were instrumental in the proof of the Strong Perfect Graph Theorem. We suggest that such pairs impose a lot of structure also in arbitrary, not just perfect graphs. To this end
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4d11184f7b66d9e9246d0df106393acc
https://doi.org/10.1007/s10107-017-1168-x
https://doi.org/10.1007/s10107-017-1168-x
Publikováno v:
Discrete Optimization. 39:100626
When solving the linear programming (LP) relaxation of a mixed-integer program (MIP) with column generation, columns might be generated that are not needed to express any integer optimal solution. Such columns are called strongly redundant and the du
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc9e05bc50f09f5d8df81c0aca961bc4
https://doi.org/10.1016/j.disopt.2021.100626
https://doi.org/10.1016/j.disopt.2021.100626
Autor:
Jonas Witt, Karsten Behrendt
Publikováno v:
IROS
Reliable lane detection is a fundamental necessity for driver assistance, driver safety functions and fully automated vehicles. Based on other detection and classification tasks, deep learning based methods are likely to yield the most accurate outpu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::951fd8c764b918e018f12b9d790b4558
https://doi.org/10.1109/iros.2017.8202238
https://doi.org/10.1109/iros.2017.8202238
Publikováno v:
Communications in Computer and Information Science ISBN: 9783319648699
VISIGRAPP (Revised Selected Papers)
VISIGRAPP (Revised Selected Papers)
This paper tackles the problem of relative pose estimation between two monocular camera images in textureless scenes. Due to a lack of point matches, point-based approaches such as the 5-point algorithm often fail when used in these scenarios. Theref
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91e381cb5af6cef3f049dcd98835a565
https://doi.org/10.1007/978-3-319-64870-5_16
https://doi.org/10.1007/978-3-319-64870-5_16
Autor:
Jonas Witt, Marco E. Lübbecke
Publikováno v:
Experimental Algorithms ISBN: 9783319200859
SEA
SEA
Dantzig-Wolfe reformulation of a mixed integer program partially convexifies a subset of the constraints, i.e., it implicitly adds all valid inequalities for the associated integer hull. Projecting an optimal basic solution of the reformulation's LP
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3171c9e72fa36b272fee1e44d312c7fa
https://doi.org/10.1007/978-3-319-20086-6_9
https://doi.org/10.1007/978-3-319-20086-6_9
Autor:
Jonas Witt, Gerhard Mentges
Publikováno v:
ICRA
In this paper, we propose a novel multi-view method for surface reconstruction from matched line segments with applications to robotic mapping and image-based rendering. Starting from 3D line segments, plane hypotheses are formed for all non-collinea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f5075091a855526b19496723e9d39bee
Publikováno v:
Experimental Algorithms ISBN: 9783319079585
SEA
SEA
The cut packing problem in an undirected graph is to find a largest cardinality collection of pairwise edge-disjoint cuts. We provide the first experimental study of this NP-hard problem that interested theorists and practitioners alike. We propose a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6cdc695e4dacf7b68b9b33a362e94c67
https://doi.org/10.1007/978-3-319-07959-2_4
https://doi.org/10.1007/978-3-319-07959-2_4
Autor:
Jonas Witt, U. Weltin
Publikováno v:
IROS
This work is concerned with the matching of straight lines between two stereo image pairs by reprojection. While we will focus on visual odometry in the realm of simultaneous mapping and localization, the techniques are also relevant to monocular and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::68bfb82d85b36ce8628a4ed76934b944
https://doi.org/10.1109/iros.2013.6696953
https://doi.org/10.1109/iros.2013.6696953
Publikováno v:
Intelligent Robotics and Applications ISBN: 9783642335143
ICIRA (2)
ICIRA (2)
This paper presents the results of modelling, parameter identification and control of the rotational axes of a quadrotor robot. The modelling is done in Newton-Euler Formalism and has been published before. Contrarily, our method uses a Grey-Box-base
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d90c955f3d5226afe1552a804385140
https://doi.org/10.1007/978-3-642-33515-0_46
https://doi.org/10.1007/978-3-642-33515-0_46