default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIvo Nowak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j12]Ouyang Wu
, Pavlo Muts, Ivo Nowak, Eligius M. T. Hendrix:
On the use of overlapping convex hull relaxations to solve nonconvex MINLPs. J. Glob. Optim. 91(2): 415-436 (2025)- 2024
- [j11]Vanya Aziz, Ouyang Wu, Ivo Nowak, Eligius M. T. Hendrix, Jan Kronqvist:
On Optimizing Ensemble Models using Column Generation. J. Optim. Theory Appl. 203(2): 1794-1819 (2024) - [i1]A. Fuster-López, J. M. Cruz, Pablo Guerrero-García, Eligius M. T. Hendrix, Andrej Kosir, Ivo Nowak, L. Oneto, S. Sirmakessis, M. Fatima Pacheco, Florbela P. Fernandes, Ana I. Pereira:
On conceptualisation and an overview of learning path recommender systems in e-learning. CoRR abs/2406.10245 (2024) - 2020
- [j10]Pavlo Muts, Ivo Nowak, Eligius M. T. Hendrix:
The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming. J. Glob. Optim. 77(1): 75-96 (2020) - [c3]Pavlo Muts, Ivo Nowak, Eligius M. T. Hendrix:
A Resource Constraint Approach for One Global Constraint MINLP. ICCSA (3) 2020: 590-605
2010 – 2019
- 2019
- [c2]Pavlo Muts, Ivo Nowak:
Towards Multi-tree Methods for Large-Scale Global Optimization. WCGO 2019: 498-506 - 2018
- [j9]Ivo Nowak, Norman Breitfeld, Eligius M. T. Hendrix, Grégoire Njacheun-Njanzoua:
Decomposition-based Inner- and Outer-Refinement Algorithms for Global Optimization. J. Glob. Optim. 72(2): 305-321 (2018) - 2010
- [j8]Turang Ahadi-Oskui, Stefan Vigerske, Ivo Nowak, George Tsatsaronis:
Optimizing the design of complex energy conversion systems by Branch and Cut. Comput. Chem. Eng. 34(8): 1226-1236 (2010)
2000 – 2009
- 2008
- [j7]Ivo Nowak, Stefan Vigerske:
LaGO: a (heuristic) Branch and Cut algorithm for nonconvex MINLPs. Central Eur. J. Oper. Res. 16(2): 127-138 (2008) - 2007
- [j6]Stefan Vigerske, Ivo Nowak:
Adaptive discretization of convex multistage stochastic programs. Math. Methods Oper. Res. 65(2): 361-383 (2007) - 2005
- [b1]Ivo Nowak:
Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming, Second Edition. Birkhäuser Basel 2005, ISBN 978-3-7643-7238-5, pp. 3-186 - [j5]Hernán Alperin, Ivo Nowak:
Lagrangian Smoothing Heuristics for Max-Cut. J. Heuristics 11(5-6): 447-463 (2005) - [j4]Ivo Nowak:
Lagrangian decomposition of block-separable mixed-integer all-quadratic programs. Math. Program. 102(2): 295-312 (2005) - 2002
- [c1]Ivo Nowak, Hernán Alperin, Stefan Vigerske:
LaGO - An Object Oriented Library for Solving MINLPs. COCOS 2002: 32-42 - 2000
- [j3]Ivo Nowak:
Dual Bounds and Optimality Cuts for All-Quadratic Programs with Convex Constraints. J. Glob. Optim. 18(4): 337-356 (2000)
1990 – 1999
- 1999
- [j2]Ivo Nowak:
A New Semidefinite Programming Bound for Indefinite Quadratic Forms Over a Simplex. J. Glob. Optim. 14(4): 357-364 (1999) - 1997
- [j1]Ivo Nowak:
Numerical Finiteness Results for Minimal Surfaces in Three-Dimensional Space Forms. Exp. Math. 6(4): 301-315 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-10 20:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
