I. Kuban Altinel
According to our database^{1},
I. Kuban Altinel
authored at least 66 papers
between 1995 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:

at orcid.org
On csauthors.net:
Bibliography
2020
Exact solution algorithms for the maximum flow problem with additional conflict constraints.
Eur. J. Oper. Res., 2020
2019
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
Discret. Appl. Math., 2019
Comput. Oper. Res., 2019
Using branchandprice to determine optimal treatment plans for volumetric modulated arc therapy (VMAT).
Comput. Oper. Res., 2019
Branch and bound algorithms for solving the multicommodity capacitated multifacility Weber problem.
Ann. Oper. Res., 2019
Optimized Resource Allocation and Task Offload Orchestration for ServiceOriented Networks.
Proceedings of the Operations Research Proceedings 2019, 2019
A BranchandBound Algorithm for the Maximum Weight Perfect Matching Problem with Conflicting Edge Pairs.
Proceedings of the 9th International Network Optimization Conference, 2019
2018
A BranchandBound 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, timevariant 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 DantzigWolfe 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 timeinvariant quay crane assignment in container terminals.
Eur. J. Oper. Res., 2014
Location and allocation based branch and bound algorithms for the capacitated multifacility 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 multicommodity capacitated Multifacility Weber Problems.
Comput. Oper. Res., 2013
2012
J. Oper. Res. Soc., 2012
Solving the multicommodity capacitated multifacility Weber problem using Lagrangean relaxation and a subgradientlike algorithm.
J. Oper. Res. Soc., 2012
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 multicommodity capacitated multifacility 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
J. Oper. Res. Soc., 2011
Variable neighbourhood search heuristics for the probabilistic multisource 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
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
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
OR Spectr., 2009
Parametric enhancements of the EsauWilliams heuristic for the capacitated minimum spanning tree problem.
J. Oper. Res. Soc., 2009
A locationallocation heuristic for the capacitated multifacility 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 locationallocation problem with probabilistic customer locations.
Comput. Oper. Res., 2009
2008
Efficient heuristics for the rectilinear distance capacitated multifacility Weber problem.
J. Oper. Res. Soc., 2008
Eur. J. Oper. Res., 2008
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 MultiFacility Weber Problem by Simulated Annealing, Threshold Accepting and Genetic Algorithms.
Proceedings of the Metaheuristics, 2007
2006
Solving the uncapacitated multifacility Weber problem by vector quantization and selforganizing maps.
J. Oper. Res. Soc., 2006
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 Kohonenlike decomposition method for the Euclidean traveling salesman problemKNIES_DECOMPOSE.
IEEE Trans. Neural Networks, 2003
Proceedings of the NNSP 2003, 2003
2002
Reliab. Eng. Syst. Saf., 2002
Some aspects of using CASE tools in a Fusionbased application development project for production optimization.
Ind. Manag. Data Syst., 2002
A clonebased graphical modeler and mathematical model generator for optimal production planning in process industries.
Eur. J. Oper. Res., 2002
2001
J. Oper. Res. Soc., 2001
2000
Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches.
Comput. Oper. Res., 2000
A Kohonenlike 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
Proceedings of the TOOLS 1999: 31st International Conference on Technology of ObjectOriented Languages and Systems, 1999
1998
IEEE Trans. Syst. Man Cybern. Part B, 1998
Eur. J. Oper. Res., 1998
1997
INFORMS J. Comput., 1997
1995
Proceedings of International Conference on Neural Networks (ICNN'95), Perth, WA, Australia, November 27, 1995