default search action
Armagan Tarim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j35]M. Edib Gurkan
, Huseyin Tunc
Simple heuristics for the joint inventory and pricing models with fixed replenishment costs. J. Oper. Res. Soc. 76(3): 567-580 (2025) - 2024
- [j34]Roberto Rossi
On the stochastic inventory problem under order capacity constraints. Eur. J. Oper. Res. 312(2): 541-555 (2024) - [j33]Onur A. Kilic
A simple heuristic for computing non-stationary inventory policies based on function approximation. Eur. J. Oper. Res. 316(3): 899-905 (2024) - 2023
- [j32]Andrea Visentin
Stochastic dynamic programming heuristic for the (R,s,S) policy parameters computation. Comput. Oper. Res. 158: 106289 (2023) - [j31]Mengyuan Xiang, Roberto Rossi
A mathematical programming-based solution method for the nonstationary inventory problem under correlated demand. Eur. J. Oper. Res. 304(2): 515-524 (2023) - 2022
- [i14]Mervyn O'Luing, Steven D. Prestwich, S. Armagan Tarim:
A hybrid estimation of distribution algorithm for joint stratification and sample allocation. CoRR abs/2201.04068 (2022) - 2021
- [j30]Andrea Visentin
Computing optimal (R, s, S) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming. Eur. J. Oper. Res. 294(1): 91-99 (2021) - [j29]Andrei M. Bandalouski, Natalja G. Egorova, Mikhail Y. Kovalyov, Erwin Pesch
Dynamic pricing with demand disaggregation for hotel revenue management. J. Heuristics 27(5): 869-885 (2021) - [i13]Mervyn O'Luing, Steven D. Prestwich, S. Armagan Tarim:
Combining K-means type algorithms with Hill Climbing for Joint Stratification and Sample Allocation Designs. CoRR abs/2108.08038 (2021) - 2020
- [c24]Mateusz Kupper, S. Armagan Tarim, Ciara Heavin, Fiona Kiely:
Towards Transformative Analytics for Palliative Care. AMCIS 2020 - [i12]Mervyn O'Luing, Steven D. Prestwich, S. Armagan Tarim:
A Simulated Annealing Algorithm for Joint Stratification and Sample Allocation Designs. CoRR abs/2011.13006 (2020)
2010 – 2019
- 2019
- [c23]Andrea Visentin
Modelling Dynamic Programming-Based Global Constraints in Constraint Programming. WCGO 2019: 417-427 - 2018
- [j28]Steven D. Prestwich
A new causal discovery heuristic. Ann. Math. Artif. Intell. 82(4): 245-259 (2018) - [j27]Onur A. Kilic
Heuristic policies for the stochastic economic lot sizing problem with remanufacturing under service level constraints. Eur. J. Oper. Res. 267(3): 1102-1109 (2018) - [j26]Mengyuan Xiang
Computing non-stationary (s, S) policies using mixed integer linear programming. Eur. J. Oper. Res. 271(2): 490-500 (2018) - [j25]Huseyin Tunc
An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem. INFORMS J. Comput. 30(3): 492-506 (2018) - [j24]Andrei M. Bandalouski, Mikhail Y. Kovalyov
An overview of revenue management and dynamic pricing models in hotel business. RAIRO Oper. Res. 52(1): 119-141 (2018) - [c22]Steven D. Prestwich, Roberto Rossi, S. Armagan Tarim, Andrea Visentin
Towards a Closer Integration of Dynamic Programming and Constraint Programming. GCAI 2018: 202-214 - 2017
- [i11]Steven D. Prestwich, Roberto Rossi, Armagan Tarim:
Stochastic Constraint Programming as Reinforcement Learning. CoRR abs/1704.07183 (2017) - [i10]Roberto Rossi, Özgür Akgün, Steven D. Prestwich, S. Armagan Tarim:
Declarative Statistics. CoRR abs/1708.01829 (2017) - 2016
- [j23]Huseyin Tunc
The stochastic lot sizing problem with piecewise linear concave ordering costs. Comput. Oper. Res. 65: 104-110 (2016) - [c21]Steve Prestwich, S. Armagan Tarim, Roberto Rossi:
Constraint Problem Specification as Compression. GCAI 2016: 280-292 - [c20]Steven D. Prestwich, Armagan Tarim, Ibrahim Özkan:
Causal Discovery by Randomness Test. ISAIM 2016 - [c19]Andrea Visentin
Robust Principal Component Analysis by Reverse Iterative Linear Programming. ECML/PKDD (2) 2016: 593-605 - [i9]Roberto Rossi, Özgür Akgün, Steven D. Prestwich, Armagan Tarim:
The BIN_COUNTS Constraint: Filtering and Applications. CoRR abs/1611.08942 (2016) - 2015
- [j22]Roberto Rossi
Confidence-based reasoning in stochastic constraint programming. Artif. Intell. 228: 129-152 (2015) - [j21]Steven D. Prestwich, S. Armagan Tarim
Hybrid metaheuristics for stochastic constraint programming. Constraints An Int. J. 20(1): 57-76 (2015) - [c18]Steven D. Prestwich, Roberto Rossi
Randomness as a Constraint. CP 2015: 351-366 - 2014
- [j20]Roberto Rossi
Piecewise linear lower and upper bounds for the standard normal first order loss function. Appl. Math. Comput. 231: 489-502 (2014) - [j19]Roberto Rossi
Confidence-based optimisation for the newsvendor problem under binomial, Poisson and exponential demand. Eur. J. Oper. Res. 239(3): 674-684 (2014) - [j18]Huseyin Tunc
A reformulation for the stochastic lot sizing problem with service-level constraints. Oper. Res. Lett. 42(2): 161-165 (2014) - [c17]Roberto Rossi
Statistical Constraints. ECAI 2014: 777-782 - [i8]Roberto Rossi, Steven D. Prestwich, S. Armagan Tarim:
Statistical Constraints. CoRR abs/1402.5161 (2014) - 2013
- [c16]Armagan Tarim
Stochastic Linear Systems under Control Constraints: A Supply Chain Planning Tool. MIM 2013: 2003-2008 - [i7]Roberto Rossi, Onur A. Kilic, S. Armagan Tarim:
Piecewise linear approximations for the static-dynamic uncertainty strategy in stochastic lot-sizing. CoRR abs/1307.5942 (2013) - [i6]Steven D. Prestwich, S. Armagan Tarim, Roberto Rossi, Brahim Hnich:
Forecasting Intermittent Demand by Hyperbolic-Exponential Smoothing. CoRR abs/1307.6102 (2013) - 2012
- [j17]Brahim Hnich
Filtering algorithms for global chance constraints. Artif. Intell. 189: 69-94 (2012) - [j16]Roberto Rossi
Constraint programming for stochastic inventory systems under shortage cost. Ann. Oper. Res. 195(1): 49-71 (2012) - [j15]Steven D. Prestwich, Brahim Hnich
Partial symmetry breaking by local search in the group. Constraints An Int. J. 17(2): 148-171 (2012) - [j14]Roberto Rossi
Constraint-Based Local Search for Inventory Control Under Stochastic Demand and Lead Time. INFORMS J. Comput. 24(1): 66-80 (2012) - [i5]Roberto Rossi, Steven D. Prestwich, S. Armagan Tarim, Brahim Hnich:
Confidence-based Optimization for the Newsvendor Problem. CoRR abs/1207.5781 (2012) - 2011
- [j13]S. Armagan Tarim
An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints. Eur. J. Oper. Res. 215(3): 563-571 (2011) - [c15]Roberto Rossi
Finding (α, ϑ)-Solutions via Sampled SCSPs. IJCAI 2011: 2172-2177 - [i4]Roberto Rossi, S. Armagan Tarim, Onur A. Kilic:
A note on Tempelmeier's β-service measure under non-stationary stochastic demand. CoRR abs/1103.1286 (2011) - [i3]Roberto Rossi, Brahim Hnich, S. Armagan Tarim, Steven D. Prestwich:
Confidence-based Reasoning in Stochastic Constraint Programming. CoRR abs/1110.1892 (2011) - 2010
- [j12]Roberto Rossi
Scheduling internal audit activities: a stochastic combinatorial optimization problem. J. Comb. Optim. 19(3): 325-346 (2010) - [j11]Onur A. Kilic
Order acceptance in food processing systems with random raw material requirements. OR Spectr. 32(4): 905-925 (2010) - [c14]Steven D. Prestwich, S. Armagan Tarim
Stochastic Constraint Programming by Neuroevolution with Filtering. CPAIOR 2010: 282-286
2000 – 2009
- 2009
- [j10]S. Armagan Tarim
Finding reliable solutions: event-driven probabilistic constraint programming. Ann. Oper. Res. 171(1): 77-99 (2009) - [j9]S. Armagan Tarim
Cost-Based Filtering Techniques for Stochastic Inventory Control Under Service Level Constraints. Constraints An Int. J. 14(2): 137-176 (2009) - [j8]Roberto Rossi
A note on Liu-Iwamura's dependent-chance programming. Eur. J. Oper. Res. 198(3): 983-986 (2009) - [c13]Steven D. Prestwich, S. Armagan Tarim
Neuroevolutionary Inventory Control in Multi-Echelon Systems. ADT 2009: 402-413 - [c12]Brahim Hnich
Synthesizing Filtering Algorithms for Global Chance-Constraints. CP 2009: 439-453 - [c11]Steven D. Prestwich, S. Armagan Tarim
Evolving Parameterised Policies for Stochastic Constraint Programming. CP 2009: 684-691 - [i2]Armagan Tarim, Suresh Manandhar, Toby Walsh:
Stochastic Constraint Programming: A Scenario-Based Approach. CoRR abs/0903.1150 (2009) - [i1]Suresh Manandhar, Armagan Tarim, Toby Walsh:
Scenario-based Stochastic Constraint Programming. CoRR abs/0905.3763 (2009) - 2008
- [j7]Roberto Rossi
A Global Chance-Constraint for Stochastic Inventory Systems Under Service Level Constraints. Constraints An Int. J. 13(4): 490-517 (2008) - [j6]David A. Burke, Kenneth N. Brown
Learning market prices in real-time supply chain management. Comput. Oper. Res. 35(11): 3465-3478 (2008) - [j5]Armagan Tarim
Constraint programming for computing non-stationary (R, S) inventory policies. Eur. J. Oper. Res. 189(3): 1004-1021 (2008) - [c10]Roberto Rossi
Cost-Based Domain Filtering for Stochastic Constraint Programming. CP 2008: 235-250 - [c9]Steven D. Prestwich, Armagan Tarim
A Cultural Algorithm for POMDPs from Stochastic Inventory Control. Hybrid Metaheuristics 2008: 16-28 - [c8]Steven D. Prestwich, Armagan Tarim
A Steady-State Genetic Algorithm with Resampling for Noisy Inventory Control. PPSN 2008: 559-568 - 2007
- [j4]Ian P. Gent, Christopher Jefferson, Tom W. Kelsey, Inês Lynce, Ian Miguel, Peter Nightingale, Barbara M. Smith, Armagan Tarim:
Search in the patience game 'Black Hole'. AI Commun. 20(3): 211-226 (2007) - [c7]Roberto Rossi, Armagan Tarim, Brahim Hnich
Replenishment Planning for Stochastic Inventory Systems with Shortage Cost. CPAIOR 2007: 229-243 - 2006
- [j3]Armagan Tarim
Stochastic Constraint Programming: A Scenario-Based Approach. Constraints An Int. J. 11(1): 53-80 (2006) - [j2]Christopher Jefferson
Modelling and solving English Peg Solitaire. Comput. Oper. Res. 33(10): 2935-2959 (2006) - [j1]S. Armagan Tarim
Modelling and computing (Rn, Sn) policies for inventory systems with non-stationary stochastic demand. Eur. J. Oper. Res. 174(1): 581-599 (2006) - [c6]Armagan Tarim, Brahim Hnich
Event-Driven Probabilistic Constraint Programming. CPAIOR 2006: 197-211 - [c5]Armagan Tarim, Brahim Hnich
Cost-Based Filtering for Stochastic Inventory Control. CSCLP 2006: 169-183 - 2005
- [c4]Mark Bartlett, Alan M. Frisch
The Temporal Knapsack Problem and Its Solution. CPAIOR 2005: 34-48 - [c3]Armagan Tarim, Ian Miguel
A Hybrid Benders' Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse. CSCLP 2005: 133-148 - 2004
- [c2]Armagan Tarim, Ian Miguel
Echelon Stock Formulation of Arborescent Distribution Systems: An Application to the Wagner-Whitin Problem. CPAIOR 2004: 302-318 - 2003
- [c1]Suresh Manandhar, Armagan Tarim, Toby Walsh:
Scenario-based Stochastic Constraint Programming. IJCAI 2003: 257-262
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-03 00:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: