World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
31
Citations
5103
World Ranking
13524
National Ranking
5403

Overview

Hasan Pirkul is affiliated with The University of Texas at Dallas in the United States. Their academic profile primarily identifies them as a researcher active within this institution.

There is no available information on recent papers authored by Hasan Pirkul, nor on frequent co-authors with whom they collaborate. Similarly, data on publication venues where they frequently publish, book publications, and awards won are not provided.

Their main fields of study, subfields, and primary topics of research are not specified in the available data, leaving a limited view of the subject areas they focus on.

Due to the absence of detailed records on their publications and research output, the overview of Hasan Pirkul remains centered on their institutional connection rather than on explicit academic contributions or thematic domains of expertise.

Best Publications

  • Planning and coordination of production and distribution facilities for multiple commodities

    Vaidyanathan Jayaraman;Hasan Pirkul

  • A multi-commodity, multi-plant, capacitated facility location problem: formulation and efficient heuristic solution

    Hasan Pirkul;Vaidyanathan Jayaraman

  • Theory and methodology

    John Current;Hasan Pirkul

  • Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality

    Bezalel Gavish;Hasan Pirkul

  • Efficient algorithms for the capacitated concentrator location problem

    Hasan Pirkul

  • The Maximal Covering Location Problem with Capacities on Total Workload

    Hasan Pirkul;David A. Schilling

  • Production, Transportation, and Distribution Planning in a Multi-Commodity Tri-Echelon System

    Hasan Pirkul;Vaidyanathan Jayaraman

  • A heuristic solution procedure for the multiconstraint zero‐one knapsack problem

    Hasan Pirkul

  • An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems

    Hasan Pirkul;David A. Schilling

  • Algorithms for the multi-resource generalized assignment problem

    Bezalel Gavish;Hasan Pirkul

  • The siting of emergency service facilities with workload capacities and backup service

    Hasan Pirkul;David A. Schilling

  • An Experimental Analysis of Face to Face versus Computer Mediated Communication Channels

    Reza Barkhi;Varghese S. Jacob;Hasan Pirkul

  • Tabu search for graph partitioning

    Erik Rolland;Hasan Pirkul;Fred W. Glover

  • Capacitated Multiple Item Ordering Problem with Quantity Discounts

    Hasan Pirkul;Omer A. Aras

  • The capacitated maximal covering location problem with backup service

    H. Pirkul;David Schilling

  • Organizational decision support systems

    Varghese S. Jacob;Hasan Pirkul

  • An integer programming model for the allocation of databases in a distributed computer system

    Hasan Pirkul

  • Efficient Algorithms for Solving the Shortest Covering Path Problem

    John R. Current;Hasan Pirkul;Erik Rolland

  • Locating concentrators for primary and secondary coverage in a computer communications network

    H. Pirkul;S. Narasimhan;P. De

  • A Memory Adaptive Reasoning Technique for Solving the Capacitated Minimum Spanning Tree Problem

    R. Patterson;H. Pirkul;E. Rolland

Frequent Co-Authors

Bezalel Gavish
Bezalel Gavish Southern Methodist University
Vaidyanathan Jayaraman
Vaidyanathan Jayaraman S P Jain School of Global Management
John R. Current
John R. Current The Ohio State University
Fred Glover
Fred Glover University of Colorado Boulder

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens up a variety of educational tracks and job prospects, particularly through online learning. If you’re starting out or seeking flexibility, you might begin with an online associate degree in computer science. This option provides foundational tech skills and is ideal for those aiming to enter the workforce quickly.

Cost is often a major concern, but many students find solutions by attending a cheapest online college. These institutions offer quality education at lower prices, making it easier to graduate without extensive debt.

If your academic history includes a lower GPA, don’t worry—there are reputable programs designed for you. Finding a college with low gpa admission requirements can help you start or continue your computer science studies without unnecessary barriers.

After graduation, career pathways are diverse and may overlap with fields like education or environmental science. For example, you can discover unique opportunities by exploring jobs with elementary education and environmental science degree, demonstrating that a tech background can lead to impactful roles in many industries.

Best Scientists Citing Hasan Pirkul