I. Kuban Altinel

发表

Arbitrary distance function estimation using vector quantization

B. John Oommen, Necati Aras, I. Kuban Altinel, 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem

Temel Öncan, I. K. Altinel, I. Kuban Altinel, 2018, Ann. Oper. Res..

Optimal berth allocation and time-invariant quay crane assignment in container terminals

Z. Caner Taskin, I. K. Altinel, I. Kuban Altinel, 2014, Eur. J. Oper. Res..

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

Temel Öncan, I. Kuban Altinel, T. Öncan, 2009, J. Oper. Res. Soc..

Optimal sensor deployment to increase the security of the maximal breach path in border surveillance

I. K. Altinel, I. Kuban Altinel, Necati Aras, 2017, Eur. J. Oper. Res..

Wireless sensor network lifetime maximization by optimal sensor deployment, activity scheduling, data routing and sink mobility

Cem Ersoy, I. Kuban Altinel, Necati Aras, 2014, Ad Hoc Networks.

Solving probabilistic multi-facility Weber problem by vector quantization

I. K. Altinel, I. Kuban Altinel, Necati Aras, 2009, OR Spectr..

Exact solution procedures for the balanced unidirectional cyclic layout problem

Temel Öncan, I. K. Altinel, I. Kuban Altinel, 2008, Eur. J. Oper. Res..

A discrete competitive facility location model with variable attractiveness

I. K. Altinel, Hande Küçükaydin, I. Kuban Altinel, 2011, J. Oper. Res. Soc..

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

Temel Öncan, I. K. Altinel, I. Kuban Altinel, 2013, Computers & Operations Research.

A leader-follower game in competitive facility location

I. K. Altinel, Hande Küçükaydin, I. Kuban Altinel, 2012, Comput. Oper. Res..

Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches

B. John Oommen, I. K. Altinel, I. Kuban Altinel, 2000, Comput. Oper. Res..

A comparative analysis of several asymmetric traveling salesman problem formulations

Temel Öncan, Gilbert Laporte, I. K. Altinel, 2009, Comput. Oper. Res..

Using Paradigm Plus CASE tool in a Fusion-based application development project

Murat Draman, Nijaz Bajgoric, I. Kuban Altinel, 1999, Proceedings Technology of Object-Oriented Languages and Systems (Cat. No.PR00393).

Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks

I. Kuban Altinel, Necati Aras, M. Emre Keskin, 2015, Comput. Oper. Res..

Discrete vector quantization for arbitrary distance function estimation

B. John Oommen, I. Kuban Altinel, Necati Aras, 1998, IEEE Trans. Syst. Man Cybern. Part B.

Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution

I. K. Altinel, Hande Küçükaydin, I. Kuban Altinel, 2011, Eur. J. Oper. Res..

Wireless sensor network design by lifetime maximisation: an empirical evaluation of integrating major design issues and sink mobility

Cem Ersoy, I. Kuban Altinel, Necati Aras, 2016, Int. J. Sens. Networks.

A self-organizing method for map reconstruction

B. John Oommen, I. Kuban Altinel, Necati Aras, 2003, 2003 IEEE XIII Workshop on Neural Networks for Signal Processing (IEEE Cat. No.03TH8718).

Optimized Resource Allocation and Task Offload Orchestration for Service-Oriented Networks

I. K. Altinel, Cem Ersoy, Necati Aras, 2019, OR.

An evolutionary approach for tuning parametric Esau and Williams heuristics

Daniele Vigo, Temel Öncan, I. K. Altinel, 2012, J. Oper. Res. Soc..

A Branch-and-Bound Algorithm for the Maximum Weight Perfect Matching Problem with Conflicting Edge Pairs

Temel Öncan, I. Kuban Altinel, M. Hakan Akyüz, 2019, INOC.

Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations

I. Kuban Altinel, Necati Aras, Engin Durmaz, 2009, Comput. Oper. Res..

Lifetime Maximization in Wireless Sensor Networks Using a Mobile Sink with Nonzero Traveling Time

I. K. Altinel, Cem Ersoy, I. Kuban Altinel, 2011, Comput. J..

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals

Z. Caner Taskin, I. Kuban Altinel, Yavuz Bogaç Türkogullari, 2012, OR.

Component testing of a series system in a random mission

I. Kuban Altinel, Orhan Feyzioglu, Süleyman Özekici, 2002, Reliab. Eng. Syst. Saf..

Mission-Based Component Testing for Series Systems

I. K. Altinel, I. Kuban Altinel, Orhan Feyzioglu, 2011, Ann. Oper. Res..

An efficient heuristic for placement, scheduling and routing in wireless sensor networks

Cem Ersoy, I. Kuban Altinel, Yavuz Bogaç Türkogullari, 2008, 2008 23rd International Symposium on Computer and Information Sciences.

A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks

Cem Ersoy, Necati Aras, I. Kuban Altinel, 2010, Eur. J. Oper. Res..

The determination of optimal treatment plans for Volumetric Modulated Arc Therapy (VMAT)

Z. Caner Taskin, I. K. Altinel, I. Kuban Altinel, 2019, European Journal of Operational Research.

A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES_DECOMPOSE

B. John Oommen, I. K. Altinel, I. Kuban Altinel, 2003, IEEE Trans. Neural Networks.

Vector Quantization for Arbitrary Distance Function Estimation

B. John Oommen, I. K. Altinel, I. Kuban Altinel, 1997, INFORMS J. Comput..

Variable neighbourhood search heuristics for the probabilistic multi-source Weber problem

I. Kuban Altinel, Necati Aras, Kerem Can Özkisacik, 2011, J. Oper. Res. Soc..

Influence Maximization With Deactivation In Social Networks pdf

I. K. Altinel, I. Kuban Altinel, Necati Aras, 2019, Eur. J. Oper. Res..

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

Temel Öncan, I. K. Altinel, I. Kuban Altinel, 2012, Comput. Oper. Res..

A Kohonen-like Decomposition Method for the Traveling Salesman Problem: KNIESDECOMPOSE

B. John Oommen, I. Kuban Altinel, Necati Aras, 2000, ECAI.

Optimum component test plans for systems with dependent components

I. Kuban Altinel, Süleyman Özekici, 1998, Eur. J. Oper. Res..

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

Temel Öncan, I. Kuban Altinel, 2018, Electron. Notes Discret. Math..

Rectangle blanket problem: Binary integer linear programming formulation and solution algorithms pdf

Lale Akarun, I. Kuban Altinel, Baris Evrim Demiröz, 2019, Eur. J. Oper. Res..

Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks

I. K. Altinel, Cem Ersoy, I. Kuban Altinel, 2010, Comput. Networks.

A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model

I. K. Altinel, Hande Küçükaydin, I. Kuban Altinel, 2010, Hybrid Metaheuristics.

Approximating the objective function's gradient using perceptrons for constrained minimization with application in drag reduction

I. K. Altinel, I. Kuban Altinel, Necati Aras, 2015, Comput. Oper. Res..

Solving the Capacitated Multi-Facility Weber Problem by Simulated Annealing, Threshold Accepting and Genetic Algorithms

I. Kuban Altinel, Necati Aras, Sadettin Yumusak, 2007, Metaheuristics.

Assignment problem with conflicts

Temel Öncan, I. K. Altinel, I. Kuban Altinel, 2019, Comput. Oper. Res..

Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem

Temel Öncan, I. K. Altinel, I. Kuban Altinel, 2014, Ann. Oper. Res..

Product-line selection and pricing with remanufacturing under availability constraints

I. Kuban Altinel, Necati Aras, Gökçe Esenduran, 2004, SPIE Optics East.

A clone-based graphical modeler and mathematical model generator for optimal production planning in process industries

Burak Birgören, Murat Draman, Nijaz Bajgoric, 2002, Eur. J. Oper. Res..

Solving the multi-commodity capacitated multi-facility Weber problem using Lagrangean relaxation and a subgradient-like algorithm

Temel Öncan, I. K. Altinel, I. Kuban Altinel, 2012, J. Oper. Res. Soc..

Scheduling traffic lights in a capacitated junction

Mehmet Bayram Yildirim, I. K. Altinel, I. Kuban Altinel, 1994 .

Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks

I. K. Altinel, Cem Ersoy, I. Kuban Altinel, 2008, Comput. Networks.

Optimum component test plans for phased-mission systems

I. K. Altinel, I. Kuban Altinel, Orhan Feyzioglu, 2008, Eur. J. Oper. Res..

A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks

I. K. Altinel, Cem Ersoy, I. Kuban Altinel, 2010, EvoCOP.

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

Temel Öncan, I. K. Altinel, I. Kuban Altinel, 2005, J. Oper. Res. Soc..

Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals

Z. Caner Taskin, I. K. Altinel, I. Kuban Altinel, 2016, Eur. J. Oper. Res..

A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations

I. Kuban Altinel, Necati Aras, Kerem Can Özkisacik, 2009, Eur. J. Oper. Res..

Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem

I. Kuban Altinel, Necati Aras, M. Orbay, 2008, J. Oper. Res. Soc..

The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem

B. John Oommen, I. K. Altinel, I. Kuban Altinel, 1999, Neural Networks.

Efficient solution techniques for the integrated coverage, sink location and routing problem in wireless sensor networks

I. K. Altinel, Cem Ersoy, I. Kuban Altinel, 2012, Comput. Oper. Res..

Effective coverage in sensor networks: Binary integer programming formulations and heuristics

Cem Ersoy, I. Kuban Altinel, Necati Aras, 2006, 2006 IEEE International Conference on Communications.

Some aspects of using CASE tools in a Fusion-based application development project for production optimization

Murat Draman, Nijaz Bajgoric, I. Kuban Altinel, 2002, Ind. Manag. Data Syst..

Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps

I. K. Altinel, I. Kuban Altinel, Necati Aras, 2006, J. Oper. Res. Soc..

Minimum cost flow problem with conflicts

I. K. Altinel, I. Kuban Altinel, Necati Aras, 2021, Networks.

Scheduling of batch processes with operational uncertainties

I. Kuban Altinel, Ö. Hortaçsu, S. Orçun, 1996 .

Scheduling of batch processes : An industrial application in paint industry

I. K. Altinel, I. Kuban Altinel, Ö. Hortaçsu, 1997 .

A dynamic model for component testing

I. Kuban Altinel, Süleyman Özekici, 1997 .

Parametric distance functions vs. nonparametric neural networks for estimating road travel distances

Ethem Alpaydin, I. K. Altinel, I. Kuban Altinel, 1996 .

The design of optimum component test plans for system reliability

I. K. Altinel, I. Kuban Altinel, Orhan Feyzioglu, 2006, Comput. Stat. Data Anal..