I. Kuban Altinel

According to our database1, I. Kuban Altinel
  • authored at least 52 papers between 1997 and 2018.
  • has a "Dijkstra number"2 of five.



In proceedings 
PhD thesis 


On csauthors.net:


A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints.
Electronic Notes in Discrete Mathematics, 2018

Optimal sensor deployment to increase the security of the maximal breach path in border surveillance.
European Journal of Operational Research, 2017

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

Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals.
European Journal of Operational Research, 2016

Approximating the objective function's gradient using perceptrons for constrained minimization with application in drag reduction.
Computers & OR, 2015

Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks.
Computers & OR, 2015

Minimum Cost Noncrossing Flow Problem on a Layered Network.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Optimal berth allocation and time-invariant quay crane assignment in container terminals.
European Journal of Operational Research, 2014

Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem.
Annals OR, 2014

Wireless sensor network lifetime maximization by optimal sensor deployment, activity scheduling, data routing and sink mobility.
Ad Hoc Networks, 2014

Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems.
Computers & OR, 2013

An evolutionary approach for tuning parametric Esau and Williams heuristics.
JORS, 2012

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

A leader-follower game in competitive facility location.
Computers & OR, 2012

Efficient solution techniques for the integrated coverage, sink location and routing problem in wireless sensor networks.
Computers & OR, 2012

Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem.
Computers & OR, 2012

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals.
Proceedings of the Operations Research Proceedings 2012, 2012

A discrete competitive facility location model with variable attractiveness.
JORS, 2011

Variable neighbourhood search heuristics for the probabilistic multi-source Weber problem.
JORS, 2011

Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution.
European Journal of Operational Research, 2011

Lifetime Maximization in Wireless Sensor Networks Using a Mobile Sink with Nonzero Traveling Time.
Comput. J., 2011

Mission-Based Component Testing for Series Systems.
Annals OR, 2011

Optimal placement, scheduling, and routing to maximize lifetime in sensor networks.
JORS, 2010

A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks.
European Journal of Operational Research, 2010

Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks.
Computer Networks, 2010

An efficient heuristic for placement, scheduling and routing in wireless sensor networks.
Ad Hoc Networks, 2010

A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model.
Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010

A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2010

Parametric enhancements of the Esau-Williams heuristic for the capacitated minimum spanning tree problem.
JORS, 2009

A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations.
European Journal of Operational Research, 2009

A comparative analysis of several asymmetric traveling salesman problem formulations.
Computers & OR, 2009

Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations.
Computers & OR, 2009

Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem.
JORS, 2008

Exact solution procedures for the balanced unidirectional cyclic layout problem.
European Journal of Operational Research, 2008

Optimum component test plans for phased-mission systems.
European Journal of Operational Research, 2008

Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks.
Computer Networks, 2008

Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps.
JORS, 2006

The design of optimum component test plans for system reliability.
Computational Statistics & Data Analysis, 2006

Effective coverage in sensor networks: Binary integer programming formulations and heuristics.
Proceedings of IEEE International Conference on Communications, 2006

A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem.
JORS, 2005

A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES_DECOMPOSE.
IEEE Trans. Neural Networks, 2003

A self-organizing method for map reconstruction.
Proceedings of the NNSP 2003, 2003

Component testing of a series system in a random mission.
Rel. Eng. & Sys. Safety, 2002

Some aspects of using CASE tools in a Fusion-based application development project for production optimization.
Industrial Management and Data Systems, 2002

A clone-based graphical modeler and mathematical model generator for optimal production planning in process industries.
European Journal of Operational Research, 2002

Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches.
Computers & OR, 2000

A Kohonen-like Decomposition Method for the Traveling Salesman Problem: KNIESDECOMPOSE.
Proceedings of the ECAI 2000, 2000

The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem.
Neural Networks, 1999

Using Paradigm Plus CASE Tool in a Fusion-Based Application Development Project.
Proceedings of the TOOLS 1999: 31st International Conference on Technology of Object-Oriented Languages and Systems, 1999

Discrete vector quantization for arbitrary distance function estimation.
IEEE Trans. Systems, Man, and Cybernetics, Part B, 1998

Optimum component test plans for systems with dependent components.
European Journal of Operational Research, 1998

Vector Quantization for Arbitrary Distance Function Estimation.
INFORMS Journal on Computing, 1997