I. K. Altinel

发表

An Object-Oriented Optimization-based Software for Agile Manufacturing in Process Industries

Murat Draman, I. K. Altinel, Nijaz Bajgoric, 2001 .

Optimal planning and scheduling of batch plants with operational uncertainties: An industrial application to Baker's yeast production

I. K. Altinel, S. Orçun, T. Cebe, 1999 .

General continuous time models for production planning and scheduling of batch processing plants: mixed integer linear program formulations and computational issues

I. K. Altinel, S. Orçun, Ö. Hortaçsu, 2001 .

Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT)

I. K. Altinel, Z. Taşkın, P. Dursun, 2019, Comput. Oper. Res..

New heuristic methods for the capacitated multi‐facility Weber problem

I. K. Altinel, N. Aras, M. Orbay, 2007 .

Reducing the integrality gap with a modified re-formulation linearization approach

I. K. Altinel, Ö. Hortaçsu, S. Orçun, 1999 .

A GENERAL SOFTWARE TESTING MODEL INVOLVING OPERATIONAL PROFILES

I. K. Altinel, S. Özekici, Ebru Angün, 2001, Probability in the Engineering and Informational Sciences.

The design of optimum component test plans for system reliability

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

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

I. K. Altinel, Cem Ersoy, N. Aras, 2009, 2009 Second International Conference on Communication Theory, Reliability, and Quality of Service.

Scheduling of batch processes : An industrial application in paint industry

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

The design of mission-based component test plans for series connection of subsystems

I. K. Altinel, S. Özekici, Bora Çekyay, 2013 .

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

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

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

I. K. Altinel, M. Akyüz, T. Öncan, 2012, Annals of Operations Research.

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..

A comparative analysis of several asymmetric traveling salesman problem formulations

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

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.

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

I. K. Altinel, M. Akyüz, T. Öncan, 2018, Annals of Operations Research.

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.

Scheduling traffic lights in a capacitated junction

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

Minimum cost flow problem with conflicts

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

Maximum weight perfect matching problem with additional disjunctive conflict constraints

I. K. Altinel, M. Akyüz, T. Öncan, 2022, Networks.

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..

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 discrete competitive facility location model with variable attractiveness

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

A leader-follower game in competitive facility location

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

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..

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

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

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..

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.

The design of optimum component test plans in the demonstration of a series system reliability

I. K. Altinel, İsmail Kuban Altinel, 1992 .

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.

Minimizing the misinformation spread in social networks

I. K. Altinel, Necati Aras, Evren Güney, 2019, IISE Trans..

Influence Maximization With Deactivation In Social Networks pdf

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

Exact solution procedures for the balanced unidirectional cyclic layout problem

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

Vector Quantization for Arbitrary Distance Function Estimation

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

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

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

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..

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..

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..

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..

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.

An evolutionary approach for tuning parametric Esau and Williams heuristics

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

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..

Optimum component test plans for phased-mission systems

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

Design of optimum component test plans in the demonstration of diverse system performance measures

Emre Yamangil, I. K. Altinel, Bora Çekyay, 2011 .

Mission-Based Component Testing for Series Systems

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

Solving probabilistic multi-facility Weber problem by vector quantization

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

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..

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..

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..

The multi-commodity capacitated multi-facility Weber problem: heuristics and confidence intervals

Temel Öncan, I. K. Altinel, M. Hakan Akyüz, 2010 .

Minimum Cost Noncrossing Flow Problem on a Layered Network

Z. Caner Taskin, I. K. Altinel, Necati Aras, 2019, CTW.

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..

Optimal server and service deployment for multi-tier edge cloud computing

Atay Ozgovde, I. K. Altinel, Cem Ersoy, 2021, Comput. Networks.

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..

Exact solution algorithms for the maximum flow problem with additional conflict constraints

I. K. Altinel, Necati Aras, Zeynep Şuvak, 2020, Eur. J. Oper. Res..

Assignment problem with conflicts

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

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

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