Yayınlar & Eserler

SCI, SSCI ve AHCI İndekslerine Giren Dergilerde Yayınlanan Makaleler

Assignment problem with conflicts

COMPUTERS & OPERATIONS RESEARCH, cilt.111, ss.214-229, 2019 (SCI İndekslerine Giren Dergi) identifier identifier

An exact solution approach for the order batching problem

IIE TRANSACTIONS, cilt.47, sa.7, ss.728-738, 2015 (SCI İndekslerine Giren Dergi) identifier identifier

MILP formulations and an Iterated Local Search Algorithm with Tabu Thresholding for the Order Batching Problem

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, cilt.243, sa.1, ss.142-155, 2015 (SCI İndekslerine Giren Dergi) identifier identifier

Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems

COMPUTERS & OPERATIONS RESEARCH, cilt.40, sa.12, ss.3056-3068, 2013 (SCI İndekslerine Giren Dergi) identifier identifier

Heuristics for the single source capacitated multi-facility Weber problem

COMPUTERS & INDUSTRIAL ENGINEERING, cilt.64, sa.4, ss.959-971, 2013 (SCI İndekslerine Giren Dergi) identifier identifier

The minimum cost perfect matching problem with conflict pair constraints

COMPUTERS & OPERATIONS RESEARCH, cilt.40, sa.4, ss.920-930, 2013 (SCI İndekslerine Giren Dergi) identifier identifier

An efficient heuristic for the Multi-vehicle One-to-one Pickup and Delivery Problem with Split Loads

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, cilt.27, ss.169-188, 2013 (SCI İndekslerine Giren Dergi) identifier identifier

An evolutionary approach for tuning parametric Esau and Williams heuristics

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, cilt.63, sa.3, ss.368-378, 2012 (SCI İndekslerine Giren Dergi) identifier identifier

Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem

COMPUTERS & OPERATIONS RESEARCH, cilt.39, sa.2, ss.225-237, 2012 (SCI İndekslerine Giren Dergi) identifier identifier

The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm

COMPUTERS & OPERATIONS RESEARCH, cilt.37, sa.10, ss.1762-1773, 2010 (SCI İndekslerine Giren Dergi) identifier identifier

A comparative analysis of several asymmetric traveling salesman problem formulations

COMPUTERS & OPERATIONS RESEARCH, cilt.36, sa.3, ss.637-654, 2009 (SCI İndekslerine Giren Dergi) identifier identifier

Parametric enhancements of the Esau-Williams heuristic for the capacitated minimum spanning tree problem

Journal of the Operational Research Society, cilt.60, sa.2, ss.259-267, 2009 (SCI Expanded İndekslerine Giren Dergi) identifier identifier

A tabu search heuristic for the generalized minimum spanning tree problem

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, cilt.191, sa.2, ss.306-319, 2008 (SCI İndekslerine Giren Dergi) identifier identifier

Exact solution procedures for the balanced unidirectional cyclic layout problem

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, cilt.189, sa.3, ss.609-623, 2008 (SCI İndekslerine Giren Dergi) identifier identifier

VLSN search algorithms for partitioning problems using matching neighbourhoods

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, cilt.59, sa.3, ss.388-398, 2008 (SCI İndekslerine Giren Dergi) identifier identifier

Design of capacitated minimum spanning tree with uncertain cost and demand parameters

Information Sciences, cilt.177, sa.20, ss.4354-4367, 2007 (SCI Expanded İndekslerine Giren Dergi) identifier identifier

A survey of the generalized assignment problem and its applications

INFOR, cilt.45, sa.3, ss.123-141, 2007 (SCI İndekslerine Giren Dergi) identifier identifier

Design of unidirectional cyclic layouts

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, cilt.43, sa.19, ss.3983-4008, 2005 (SCI İndekslerine Giren Dergi) identifier identifier

A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, cilt.56, sa.8, ss.954-961, 2005 (SCI İndekslerine Giren Dergi) identifier identifier

Diğer Dergilerde Yayınlanan Makaleler

A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints

Electronic Notes in Discrete Mathematics, cilt.64, ss.5-14, 2018 (Diğer Kurumların Hakemli Dergileri) identifier

Hakemli Kongre / Sempozyum Bildiri Kitaplarında Yer Alan Yayınlar

An exact algorithm for the maximum weight perfect matching problem with conflicts

17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019, Enschede, Hollanda, 1 - 03 Temmuz 2019, ss.111-114 identifier

An MILP Model for the Internal Audit Scheduling Problem

IEEE International Conference on Industrial Engineering and Engineering Management (IEEE IEEM), Bangkok, Tayland, 16 - 19 Aralık 2018, ss.442-446 identifier

Iterated exact and heuristic algorithms for the minimum cost bipartite perfect matching problem with conflict constraints

2017 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2017, Singapore, Singapur, 10 - 13 Aralık 2017, ss.1032-1036 identifier identifier

A Tabu Search Based Heuristic Approach for the Dynamic Container Relocation Problem

Operations Research Conference (OR), Vienna, Avusturya, 1 - 04 Eylül 2015, ss.165-171 identifier

Tabu Search Heuristics for Two Bounded Degree Spanning Tree Problems

15th IFAC Symposium on Information Control Problems in Manufacturing, Ottawa, Kanada, 11 - 13 Mayıs 2015, cilt.48, ss.1167-1172 identifier identifier

New formulations for the minimum branch vertices problem

World Congress on Engineering and Computer Science 2014, WCECS 2014, California, Amerika Birleşik Devletleri, 22 - 24 Ekim 2014, cilt.2, ss.1101-1106 identifier

A fuzzy multi-attribute decision making approach for the dealers' selection problem of an automotive company

Joint International Symposium on "The Social Impacts of Developments in Information, Manufacturing and Service Systems" 44th International Conference on Computers and Industrial Engineering, CIE 2014 and 9th International Symposium on Intelligent Manufacturing and Service Systems, IMSS 2014, İstanbul, Türkiye, 14 - 16 Ekim 2014, ss.1039-1044 identifier

MILP formulations for the order batching problem in low-level picker-to-part warehouse systems

7th IFAC Conference on Manufacturing Modelling, Management, and Control, MIM 2013, Saint Petersburg, Rusya, 19 - 21 Haziran 2013, cilt.46, ss.471-476 identifier

A Genetic Algorithm for the Order Batching Problem in low-level picker-to-part warehouse systems

International MultiConference of Engineers and Computer Scientists 2013, IMECS 2013, Kowloon, Hong Kong, 13 - 15 Mart 2013, cilt.2202, ss.19-24 identifier

A Beam Search Heuristic for the Multi-commodity Capacitated Multi-facility Weber Problem

International MultiConference of Engineers and Computer Scientists (IMECS 2012), Hong Kong, PEOPLES R CHINA, 14 - 16 Mart 2012, ss.1617-1622 identifier identifier

A Branch and Cut Algorithm for the Multi-Vehicle One-to-One Pickup and Delivery Problem with Split Loads

IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), Singapore, Singapur, 6 - 09 Aralık 2011, ss.1864-1868 identifier identifier

The Multi-commodity Capacitated Multi-facility Weber Problem: Heuristics and Confidence Intervals

International Multi-Conference of Engineers and Computer Scientists, Kowloon, Hong Kong, 18 - 20 Mart 2009, ss.2042-2043 identifier

An Application of Responsive Manufacturing Control

2nd International Conference on Responsive Manufacturing, 26 - 28 Haziran 2002, ss.812-817