Anja Fischer

Orcid: 0000-0002-2812-043X

Affiliations:
  • TU Dortmund, Germany


According to our database1, Anja Fischer authored at least 26 papers between 2009 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Exact approaches for the combined cell layout problem.
Eur. J. Oper. Res., 2023

2022
Matroid optimization problems with monotone monomials in the objective.
Discret. Appl. Math., 2022

2020
Decorous combinatorial lower bounds for row layout problems.
Eur. J. Oper. Res., 2020

1A-Team / Martin-Luther-Universität Halle-Wittenberg@CLSciSumm 20.
Proceedings of the First Workshop on Scholarly Document Processing, 2020

2019
New exact approaches to row layout problems.
Math. Program. Comput., 2019

Counting degree sequences of spanning trees in bipartite graphs: A graph-theoretic proof.
J. Graph Theory, 2019

Design of the Operator Tracing Robot for Material Handling.
Proceedings of the 2019 International Conference on Information and Communication Technology Convergence, 2019

2018
Matroid optimisation problems with nested non-linear monomials in the objective function.
Math. Program., 2018

Improved exact approaches for row layout problems with departments of equal length.
Eur. J. Oper. Res., 2018

2017
The traveling salesman problem on grids with forbidden neighborhoods.
J. Comb. Optim., 2017

The Traveling Salesperson Problem with Forbidden Neighborhoods on Regular 3D Grids.
Proceedings of the Operations Research Proceedings 2017, 2017

Closed Almost Knight's Tours on 2D and 3D Chessboards.
Proceedings of the Operations Research Proceedings 2017, 2017

2016
Linear Models and Computational Experiments for the Quadratic TSP.
Electron. Notes Discret. Math., 2016

2015
An extended approach for lifting clique tree inequalities.
J. Comb. Optim., 2015

Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem.
Comput., 2015

A New Exact Approach to the Space-Free Double Row Layout Problem.
Proceedings of the Operations Research Proceedings 2015, 2015

2014
An Analysis of the Asymmetric Quadratic Traveling Salesman Polytope.
SIAM J. Discret. Math., 2014

Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics.
Discret. Appl. Math., 2014

A Polyhedral Study of the Quadratic Traveling Salesman Problem.
Proceedings of the Operations Research Proceedings 2014, 2014

Solution Approaches for the Double-Row Equidistant Facility Layout Problem.
Proceedings of the Operations Research Proceedings 2014, 2014

2013
Complete description for the spanning tree problem with one linearised quadratic term.
Oper. Res. Lett., 2013

The symmetric quadratic traveling salesman problem.
Math. Program., 2013

2012
Simulation and optimization of robot driven production systems for peak-load reduction.
Proceedings of the Winter Simulation Conference, 2012

Deciding the Twins Property for Weighted Tree Automata over Extremal Semifields.
Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing, 2012

2010
Efficient Algorithmic Safety Analysis of HRU Security Models.
Proceedings of the SECRYPT 2010, 2010

2009
Software Architectural Design Meets Security Engineering.
Proceedings of the 16th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems, 2009


  Loading...