Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Jan Boeckmann
Observed name:
Boeckmann, Jan
Institutions:
Karlsruhe Institute of Technology,
Johannes Kepler University of Linz,
Catholic University of Eichstätt-Ingolstadt
Observed institutions:
Karlsruhe Institute of Technology,
Johannes Kepler University of Linz,
Catholic University of Eichstätt-Ingolstadt,
Weihenstephan-Triesdorf University of Applied Sciences,
Technical University of Munich
ORCID:
0000-0001-5909-8354
Observed ORCID:
0000-0001-5909-8354
OpenAlex ID:
A5033166559
A (B+1) -approximation for network flow interdiction with unit costs
2021
·
Jan Boeckmann
, Clemens Thielen
·
Discrete Applied Mathematics
·
8
PDF
Approximating single- and multi-objective nonlinear sum and product knapsack problems
2023
·
Jan Boeckmann
, Clemens Thielen
, et al.
·
Discrete Optimization
·
6
Complexity of the Temporal Shortest Path Interdiction Problem
2023
·
Boeckmann, Jan
, Thielen, Clemens
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
2
PDF
An Approximation Algorithm for Network Flow Interdiction with Unit Costs and Two Capacities
2020
·
Jan Boeckmann
, Clemens Thielen
·
AIRO Springer series/AIRO Springer Series
·
2
A General Multicriteria Optimization Perspective on Resilience
2026
·
Helfrich, Stephan
, Ciolacu, Gabriela
, et al.
·
arXiv (Cornell University)
PDF
A general framework for physician rostering using mixed-integer programming and a web-based graphical user interface
2026
·
Florian Meier
, Jan Boeckmann
, et al.
·
Operations Research Data Analytics and Logistics
Tractable but Hard to Approximate: The Bi‐Objective Minimum s‐t‐Cut Problem With Binary Capacities
2026
·
Jan Boeckmann
, Stephan Helfrich
, et al.
·
Networks
New Ways in Municipal Flood Mitigation: a Mixed-Integer Programming Approach and its Practical Application
2023
·
Jan Boeckmann
, Clemens Thielen
·
Operations Research Forum
PDF
Show more works
View as search
Works count:
10
Citation count:
18
H-index:
2
I10-index:
Year
Topic
Type