I. Kuban Altinel

According to our database1, I. Kuban Altinel authored at least 66 papers between 1995 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Exact solution algorithms for the maximum flow problem with additional conflict constraints.
Eur. J. Oper. Res., 2020

2019
Influence maximization with deactivation in social networks.
Eur. J. Oper. Res., 2019

The determination of optimal treatment plans for Volumetric Modulated Arc Therapy (VMAT).
Eur. J. Oper. Res., 2019

Rectangle blanket problem: Binary integer linear programming formulation and solution algorithms.
Eur. J. Oper. Res., 2019

Minimum cost noncrossing flow problem on layered networks.
Discret. Appl. Math., 2019

Assignment problem with conflicts.
Comput. Oper. Res., 2019

Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT).
Comput. Oper. Res., 2019

Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem.
Ann. Oper. Res., 2019

Optimized Resource Allocation and Task Offload Orchestration for Service-Oriented Networks.
Proceedings of the Operations Research Proceedings 2019, 2019

A Branch-and-Bound Algorithm for the Maximum Weight Perfect Matching Problem with Conflicting Edge Pairs.
Proceedings of the 9th International Network Optimization Conference, 2019

2018
A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints.
Electron. Notes Discret. Math., 2018

2017
Optimal sensor deployment to increase the security of the maximal breach path in border surveillance.
Eur. J. Oper. Res., 2017

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

Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals.
Eur. J. Oper. Res., 2016

2015
Approximating the objective function's gradient using perceptrons for constrained minimization with application in drag reduction.
Comput. Oper. Res., 2015

Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks.
Comput. Oper. Res., 2015

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

2014
Optimal berth allocation and time-invariant quay crane assignment in container terminals.
Eur. J. Oper. Res., 2014

Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem.
Ann. Oper. Res., 2014

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

2013
Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems.
Comput. Oper. Res., 2013

2012
An evolutionary approach for tuning parametric Esau and Williams heuristics.
J. Oper. Res. Soc., 2012

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

A leader-follower game in competitive facility location.
Comput. Oper. Res., 2012

Efficient solution techniques for the integrated coverage, sink location and routing problem in wireless sensor networks.
Comput. Oper. Res., 2012

Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem.
Comput. Oper. Res., 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

2011
A discrete competitive facility location model with variable attractiveness.
J. Oper. Res. Soc., 2011

Variable neighbourhood search heuristics for the probabilistic multi-source Weber problem.
J. Oper. Res. Soc., 2011

Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution.
Eur. J. Oper. Res., 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.
Ann. Oper. Res., 2011

2010
Optimal placement, scheduling, and routing to maximize lifetime in sensor networks.
J. Oper. Res. Soc., 2010

A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks.
Eur. J. Oper. Res., 2010

Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks.
Comput. 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

2009
Solving probabilistic multi-facility Weber problem by vector quantization.
OR Spectr., 2009

Parametric enhancements of the Esau-Williams heuristic for the capacitated minimum spanning tree problem.
J. Oper. Res. Soc., 2009

A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations.
Eur. J. Oper. Res., 2009

A comparative analysis of several asymmetric traveling salesman problem formulations.
Comput. Oper. Res., 2009

Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations.
Comput. Oper. Res., 2009

2008
Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem.
J. Oper. Res. Soc., 2008

Exact solution procedures for the balanced unidirectional cyclic layout problem.
Eur. J. Oper. Res., 2008

Optimum component test plans for phased-mission systems.
Eur. J. Oper. Res., 2008

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

2007
Solving the Capacitated Multi-Facility Weber Problem by Simulated Annealing, Threshold Accepting and Genetic Algorithms.
Proceedings of the Metaheuristics, 2007

2006
Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps.
J. Oper. Res. Soc., 2006

The design of optimum component test plans for system reliability.
Comput. Stat. Data Anal., 2006

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

2005
A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem.
J. Oper. Res. Soc., 2005

2003
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

2002
Component testing of a series system in a random mission.
Reliab. Eng. Syst. Saf., 2002

Some aspects of using CASE tools in a Fusion-based application development project for production optimization.
Ind. Manag. Data Syst., 2002

A clone-based graphical modeler and mathematical model generator for optimal production planning in process industries.
Eur. J. Oper. Res., 2002

2001
Component testing of repairable systems in multistage missions.
J. Oper. Res. Soc., 2001

2000
Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches.
Comput. Oper. Res., 2000

A Kohonen-like Decomposition Method for the Traveling Salesman Problem: KNIES<sub>DECOMPOSE</sub>.
Proceedings of the ECAI 2000, 2000

1999
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

1998
Discrete vector quantization for arbitrary distance function estimation.
IEEE Trans. Syst. Man Cybern. Part B, 1998

Optimum component test plans for systems with dependent components.
Eur. J. Oper. Res., 1998

1997
Vector Quantization for Arbitrary Distance Function Estimation.
INFORMS J. Comput., 1997

1995
Arbitrary distance function estimation using vector quantization.
Proceedings of International Conference on Neural Networks (ICNN'95), Perth, WA, Australia, November 27, 1995


  Loading...