Dursun A. Bulutoglu

Orcid: 0000-0002-7117-3502

According to our database1, Dursun A. Bulutoglu authored at least 10 papers between 2007 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A bit-parallel tabu search algorithm for finding E(s<sup>2</sup>)-optimal and minimax-optimal supersaturated designs.
CoRR, 2023

The dimension of an orbitope based on a solution to the Legendre pair problem.
CoRR, 2023

A Bit-Parallel Tabu Search Algorithm for Finding E s 2 -Optimal and Minimax-Optimal Supersaturated Designs.
Comput. Math. Methods, 2023

2022
Finding the dimension of a non-empty orthogonal array polytope.
Discret. Optim., 2022

2021
A Legendre pair of length 77 using complementary binary matrices with fixed marginals.
Des. Codes Cryptogr., 2021

2019
Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays.
Discret. Optim., 2019

2016
The linear programming relaxation permutation symmetry group of an orthogonal array defining integer linear program.
LMS J. Comput. Math., 2016

2015
Algorithms for finding generalized minimum aberration designs.
J. Complex., 2015

2010
Minimum Aberration Fractional Factorial Designs With Large <i>N</i>.
Technometrics, 2010

2007
An analysis of XML compression efficiency.
Proceedings of the Workshop on Experimental Computer Science, 2007


  Loading...