default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFritz Bökler
Person information
- affiliation: Osnabrück University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Fritz Bökler
, Henning Jasper:
Complexity of the multiobjective minimum weight minimum stretch spanner problem. Math. Methods Oper. Res. 100(1): 65-83 (2024)- [j3]Fritz Bökler, Sophie N. Parragh, Markus Sinnl, Fabien Tricoire:
An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems. Math. Methods Oper. Res. 100(1): 263-290 (2024) - [c7]Fritz Bökler, Markus Chimani, Henning Jasper, Mirko H. Wagner:
Exact Minimum Weight Spanners via Column Generation. ESA 2024: 30:1-30:17 - [i6]Fritz Bökler, Markus Chimani, Henning Jasper, Mirko H. Wagner:
Exact Minimum Weight Spanners via Column Generation. CoRR abs/2406.19164 (2024) - 2022
- [j2]Fritz Bökler, Markus Chimani, Mirko H. Wagner:
On the rectangular knapsack problem. Math. Methods Oper. Res. 96(1): 149-160 (2022) - [c6]Fritz Bökler, Levin Nemesch, Mirko H. Wagner:
PaMILO: A Solver for Multi-objective Mixed Integer Linear Optimization and Beyond. OR 2022: 163-170 - [i5]Fritz Bökler, Henning Jasper:
Complexity of the Multiobjective Spanner Problem. CoRR abs/2206.08805 (2022) - [i4]Fritz Bökler, Levin Nemesch, Mirko H. Wagner:
PaMILO: A Solver for Multi-Objective Mixed Integer Linear Optimization and Beyond. CoRR abs/2207.09155 (2022) - 2020
- [c5]Fritz Bökler, Markus Chimani:
Approximating Multiobjective Shortest Path in Practice. ALENEX 2020: 120-133 - [c4]Fritz Bökler, Markus Chimani, Mirko H. Wagner, Tilo Wiedera:
An Experimental Study of ILP Formulations for the Longest Induced Path Problem. ISCO 2020: 89-101 - [i3]Markus Chimani, Fritz Bökler, Mirko H. Wagner, Tilo Wiedera:
An Experimental Study of ILP Formulations for the Longest Induced Path Problem. CoRR abs/2002.07012 (2020)
2010 – 2019
- 2018
- [b1]Fritz Bökler:
Output-sensitive complexity of multiobjective combinatorial optimization with an application to the multiobjective shortest path problem. Dortmund University, Germany, 2018 - [j1]Daniel Bachmann, Fritz Bökler, Jakob Kopec, Kira Popp, Björn Schwarze, Frank Weichert:
Multi-Objective Optimisation Based Planning of Power-Line Grid Expansions. ISPRS Int. J. Geo Inf. 7(7): 258 (2018) - 2017
- [c3]Fritz Bökler:
The Multiobjective Shortest Path Problem Is NP-Hard, or Is It? EMO 2017: 77-87 - [c2]Fritz Bökler, Petra Mutzel:
Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem. WALCOM 2017: 190-203 - 2016
- [i2]Fritz Bökler, Petra Mutzel:
Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem. CoRR abs/1604.08147 (2016) - [i1]Fritz Bökler, Matthias Ehrgott, Christopher Morris, Petra Mutzel:
Output-sensitive Complexity of Multiobjective Combinatorial Optimization. CoRR abs/1610.07204 (2016) - 2015
- [c1]Fritz Bökler, Petra Mutzel:
Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems. ESA 2015: 288-299
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-04 21:02 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:
