İ. Kuban Altınel
Email:
Phone:
7076
B.S. in IE, Istanbul Technical University, 1982;
M.S. in IE OR, Columbia University, 1985;
M.S. in IE, University of Pittsburgh, 1989;
Ph.D. in IE, University of Pittsburgh, 1990.
Research Interests:
Linear and combinatorial optimization, Graphs and network flows, Mathematical programming applications in statistics and machine learning, Wireless sensor networks, Social Networks
Recent publications
-
Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches, , Computers & Operations Research, Volume 27, p.461–494, (2000)
-
A Kohonen-like Decomposition Method for the Traveling Salesman Problem: KNIESDECOMPOSE, , European Conference on Artificial Intelligence, p.261–265, (2000)
-
Optimal planning and scheduling of batch plants with operational uncertainties: An industrial application to Baker's yeast production, , Computers & Chemical Engineering, Volume 23, (1999)
-
Using Paradigm Plus CASE Tool in a Fusion-Based Application Development Project, , Technology of Object-Oriented Languages and Systems, p.424–427, (1999)
-
The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem, , Neural Networks, Volume 12, p.1273–1284, (1999)
-
Reducing the integrality gap with a modified re-formulation linearization approach, , Computers & Chemical Engineering, Volume 23, (1999)
-
Solving the Travelling Salesman Problem using the Kohonen Network Incorporating Explicit Statistics, , Neural Nets WIRN VIETRI-98, p.273–282, (1999)
-
Optimum component test plans for systems with dependent components, , European Journal of Operational Research, Volume 111, p.175–186, (1998)
-
Discrete vector quantization for arbitrary distance function estimation, , IEEE Transactions on Systems, Man, and Cybernetics, Volume 28, p.496–510, (1998)
-
Arbitrary distance function estimation using discrete vector quantization, , Neural Networks, 1997., International Conference on, Volume 2, p.1272–1277, (1997)
- ‹ previous
- 7 of 8
- next ›