Researcher Evidence Record
Markus Sinnl
This bounded record lists 24 Pith paper rows and 0 imported work rows attributed to this corpus identity. The enumerated, non-disputed paper rows include math.OC, cs.DS, cs.LG work dated 2019 to 2026. The record describes sources and coverage; it makes no judgment about the person.
Compiled coverage vector
A sourced case file for attributed work. It is neither a profile score nor a verdict about this researcher.
Attributed works
A bounded ledger from the Pith paper and imported-work queries. Counts and source confidence stay with each work.
-
2026 Pith paper
An semidefinite programming-based $\varepsilon$-constraint method for the bi-objective single-row facility layout problem
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 3
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: a current Pith review exists.
- Citation counts
- No source count is attached to this work row.
-
2026 Pith paper
A note on the maximal covering location problem with customer preference ordering
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 2
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: a current Pith review exists.
- Citation counts
- No source count is attached to this work row.
-
2026 Pith paper
Investigating mixed-integer programming approaches for the $p$-$\alpha$-closest-center problem
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 3
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: a current Pith review exists.
- Citation counts
- No source count is attached to this work row.
-
2025 Pith paper
A matheuristic for solving the single row facility layout problem
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 2
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: a current Pith review exists.
- Citation counts
- No source count is attached to this work row.
-
2024 Pith paper
Mixed-integer linear programming approaches for nested $p$-center problems with absolute and relative regret objectives
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 2
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: no current Pith review exists.
- Citation counts
- No source count is attached to this work row.
-
2024 Pith paper
Competing for the most profitable tour: The orienteering interdiction game
paper citation record paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 2
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: no current Pith review exists.
- Citation counts
-
- 1 pith inbound references from cited_work_pith_inbound_counts
-
2023 Pith paper
Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 4
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: no current Pith review exists.
- Citation counts
- No source count is attached to this work row.
-
2022 Pith paper
Exact solution approaches for the discrete $\alpha$-neighbor $p$-center problem
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 2
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: no current Pith review exists.
- Citation counts
- No source count is attached to this work row.
-
2022 Pith paper
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 4
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: no current Pith review exists.
- Citation counts
- No source count is attached to this work row.
-
2022 Pith paper
A matheuristic for tri-objective binary integer programming
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 3
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: no current Pith review exists.
- Citation counts
- No source count is attached to this work row.
-
2021 Pith paper
An Exact Method for Fortification Games
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 4
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: no current Pith review exists.
- Citation counts
- No source count is attached to this work row.
-
2021 Pith paper
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 4
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: no current Pith review exists.
- Citation counts
- No source count is attached to this work row.
-
2021 Pith paper
On Solving the Minimum Common String Partition Problem by Decision Diagrams
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 2
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: no current Pith review exists.
- Citation counts
- No source count is attached to this work row.
-
2021 Pith paper
A scaleable projection-based branch-and-cut algorithm for the $p$-center problem
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 2
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: no current Pith review exists.
- Citation counts
- No source count is attached to this work row.
-
2021 Pith paper
An iterative exact algorithm for the weighted fair sequences problem
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 1
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: no current Pith review exists.
- Citation counts
- No source count is attached to this work row.
-
2021 Pith paper
Experiments with graph convolutional networks for solving the vertex $p$-center problem
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 2
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: no current Pith review exists.
- Citation counts
- No source count is attached to this work row.
-
2021 Pith paper
An outer approximation algorithm for multi-objective mixed-integer linear and non-linear programming
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 3
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: no current Pith review exists.
- Citation counts
- No source count is attached to this work row.
-
2021 Pith paper
A branch-and-cut algorithm for submodular interdiction games
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 2
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: no current Pith review exists.
- Citation counts
- No source count is attached to this work row.
-
2021 Pith paper
A LP relaxation based matheuristic for multi-objective integer programming
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 3
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: no current Pith review exists.
- Citation counts
- No source count is attached to this work row.
-
2019 Pith paper
A note on computational approaches for the antibandwidth problem
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 1
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: no current Pith review exists.
- Citation counts
- No source count is attached to this work row.
-
2019 Pith paper
Exact and heuristic algorithms for the weighted total domination problem
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 2
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: no current Pith review exists.
- Citation counts
- No source count is attached to this work row.
-
2019 Pith paper
An exact solution framework for the multiple gradual cover location problem
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 2
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: no current Pith review exists.
- Citation counts
- No source count is attached to this work row.
-
2019 Pith paper
The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 4
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: no current Pith review exists.
- Citation counts
- No source count is attached to this work row.
-
2019 Pith paper
Algorithmic expedients for the S-labeling problem
paper paper evidence challenge this paper
Sources and evidence
- Authorship source
- arxiv_oai
- Printed name
- Markus Sinnl
- Author position
- 1
- Identity state
- provisional
- Source confidence
- 0.7
- Review coverage
- Measured: no current Pith review exists.
- Citation counts
- No source count is attached to this work row.
Evidence apparatus
The machinery behind this record. Every lane states whether Pith measured it, did not query it, could not reach it, or withheld it.
| Lane | State | Observed | Boundary and source |
|---|---|---|---|
| identity | Measured | 2 | Canonical identity row plus public typed identifiers. source=authors, author_identifiers |
| papers | Measured | 24 of 24 bounded rows | Rows attributed to this author UUID in the Pith corpus. source=paper_authors |
| works | Measured zero | 0 of 0 bounded rows | Imported works not duplicated by the paper ledger. source=author_works |
| reviews | Measured | 4 of 24 bounded rows | Coverage count only. No review outcome is projected onto the person. source=current_verdicts |
| citations | Measured | 1 of 24 bounded rows | Counts remain itemized by work and source. source=cited_works |
| coauthors | Measured | 18 of 24 bounded rows | Shared-work edges from admitted paper rows. source=paper_authors |
| account | Unavailable | No public count of 1 bounded rows | Account metadata is separate from corpus evidence. source=users.author_id |
Public identity sources
-
name variant
Markus Sinnl
Enumerated research scope
- math.OC21 rows
- cs.DS2 rows
- cs.LG1 rows
- 20195 rows
- 20219 rows
- 20223 rows
- 20231 rows
- 20242 rows
- 20251 rows
- 20263 rows
Record scope
The work queries are bounded. Missing rows may mean measured zero, an unavailable source, a query that did not run, or private data that Pith withheld. The lane table keeps those cases separate.
Paper findings remain attached to papers. They do not become findings about this researcher.
Self-published account annex
Linked Pith account
Unavailable No public Pith account is linked to this corpus identity.
The account lane is self-published. Linking proves account control only and changes no corpus fact.