Aydin Sipahioglu

Publication Activity (10 Years)

Years Active: 2007-2020
Publications (10 Years): 1

Top Topics

Knapsack Problem

Implicit Enumeration

Uncertain Environments

Top Venues

IEEE Trans. Cybern.

Comput. Oper. Res.

ICPR-Americas (1)

Publications

Islam Altin, Aydin Sipahioglu
Simulated Annealing Algorithm for In-Plant Milk-Run System. ICPR-Americas (1) (2020)
Ahmet Yazici, Gokhan Kirlik, Osman Parlaktuna, Aydin Sipahioglu
A Dynamic Path Planning Approach for Multirobot Sensor-Based Coverage Considering Energy Constraints. IEEE Trans. Cybern. 44 (3) (2014)
Tugba Saraç, Aydin Sipahioglu
Generalized quadratic multiple knapsack problem and two solution approaches. Comput. Oper. Res. 43 (2014)
Gokhan Kirlik, Aydin Sipahioglu
Capacitated arc routing problem with deadheading demands. Comput. Oper. Res. 39 (10) (2012)
Aydin Sipahioglu, Gokhan Kirlik, Osman Parlaktuna, Ahmet Yazici
Energy constrained multi-robot sensor-based coverage path planning using capacitated arc routing approach. Robotics Auton. Syst. 58 (5) (2010)
Ahmet Yazici, Gokhan Kirlik, Osman Parlaktuna, Aydin Sipahioglu
A dynamic path planning approach for multi-robot sensor-based coverage considering energy constraints. IROS (2009)
Aydin Sipahioglu, Tugba Saraç
The Performance of the Modified Subgradient Algorithm on Solving the 0-1 Quadratic Knapsack Problem. Informatica 20 (2) (2009)
Ahmet Yazici, Aydin Sipahioglu, Osman Parlaktuna
Heuristic-Based Dynamic Route Planning Method for a Homogeneous Multi-robot Team. Adv. Robotics 23 (3) (2009)
Osman Parlaktuna, Aydin Sipahioglu, Gokhan Kirlik, Ahmet Yazici
Multi-robot sensor-based coverage path planning using capacitated arc routing approach. CCA/ISIC (2009)
Aydin Sipahioglu, Ahmet Yazici, Osman Parlaktuna, Ugur Gurel
Real-time tour construction for a mobile robot in a dynamic environment. Robotics Auton. Syst. 56 (4) (2008)
Tugba Saraç, Aydin Sipahioglu
A Genetic Algorithm for the Quadratic Multiple Knapsack Problem. BVAI (2007)
Rafail N. Gasimov, Aydin Sipahioglu, Tugba Saraç
A multi-objective programming approach to 1.5-dimensional assortment problem. Eur. J. Oper. Res. 179 (1) (2007)