·
A Multi-Stage Stochastic Programming
Approach in Master Production Scheduling.
E. Korpeoglu, H. Yaman, and M.S.
Akturk.
European Journal
of Operational Research, Vol. 213,
166-179, 2011.
·
The Vendor Location Problem.
Y. Cinar and H. Yaman.
Computers
& Operations Research, Vol. 38, 1678-1695, 2011.
·
An Intermodal Multicommodity Routing
Problem with Scheduled Services.
B. Ayar and H. Yaman.
To appear in Computational
Optimization and Applications.
·
Survivability in Hierarchical
Telecommunications Networks.
P. Fouilhoux, O.E. Karasan, A.R.
Mahjoub, O. Ozkok, and H. Yaman.
To appear in Networks.
·
The Robust Network Loading Problem
Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and
Computations.
A.Altin, H. Yaman, and M.C. Pinar.
INFORMS
Journal on Computing, Vol. 23, 75-89, 2011.
·
Allocation Strategies in Hub Networks.
H. Yaman.
European
Journal of Operational Research, Vol. 211, 442-451, 2011.
·
A Hybrid Polyhedral Uncertainty Model
for the Robust Network Loading Problem.
A.Altin, H. Yaman, and M.C. Pinar.
In Performance Models and Risk Management
in Communications Systems, N.
Gulpinar, P. Harrison and B. Rustem (Eds.), 157-172, Springer,
2011.
·
Health
Network Mergers and Hospital Re-Planning.
E.D.
Gunes and H. Yaman.
Journal
of the Operational Research Society, Vol. 61, 275-283, 2010.
·
Polyhedral Analysis for the Two Item
Uncapacitated Lot Sizing Problem with One Way Substitution.
H. Yaman.
Discrete Applied Mathematics, Vol. 157, 3133-3151, 2009.
(Erratum,
Discrete Applied Mathematics 159, 1058, 2011).
·
Generating Facets for the Independence
System Polytope.
P. Fouilhoux,
M. Labbe, A.R. Mahjoub, and H. Yaman.
SIAM
Journal on Discrete Mathematics, Vol. 23 1484-1506, 2009.
·
The Hierarchical Hub Median Problem
with Single Assignment.
H. Yaman.
Transportation
Research Part B, Vol. 43, 643-658, 2009.
·
Linear
inequalities among graph invariants: using GraPHedron to uncover optimal
relationships.
J. Christophe, S. Dewez, J. Doignon, S. Elloumi, G.
Fasbender, P. Grégoire, D. Huygens, M. Labbé, H. Mélot, and H. Yaman.
Networks, Vol. 52, 287-298,
2008.
·
Manufacturer’s
Mixed Pallet Design Problem.
H. Yaman and
A. Sen.
European
Journal of Operational Research, Vol. 186, 826-840, 2008.
·
Star p-hub Median Problem with Modular
Arc Capacities.
H. Yaman.
Computers & Operations Research, Vol. 35, 3009-3019, 2008.
·
Solving
the Hub Location Problem in a Star-Star Network.
M. Labbe and H. Yaman.
Networks, Vol. 51, 19-33, 2008.
·
Damacana Su Pazar Analizi ve Dagitim
Agi Tasarimi.
S. Ayabakan, A. Celik, E. Erdogan, C.
Karakan, S. Kocak, D. Konur, and H. Yaman.
Endustri
Muhendisligi, Vol. 18(3),
2-12, 2007.
·
The Integer Knapsack Cover Polyhedron.
H.
Yaman.
SIAM
Journal on Discrete Mathematics, Vol. 21, 551-572, 2007.
·
The Latest Arrival Hub Location
Problem for Cargo Delivery Systems with
Stopovers.
H.
Yaman, B.Y. Kara, and B.C. Tansel.
Transportation
Research Part B, Vol. 41, 906-919, 2007.
·
Restricted Robust Uniform Matroid Maximization Under
Interval Uncertainty.
H. Yaman, O.E. Karasan, and M.C. Pinar.
Mathematical
Programming, Vol. 110, 431-441, 2007.
·
Polyhedral
Analysis for Concentrator Location Problems.
M. Labbe and H. Yaman.
Computational
Optimization and Applications, Vol. 34, 377-407,
2006.
·
Formulations
and Valid Inequalities for the Heterogeneous Vehicle Routing Problem.
H. Yaman.
Mathematical Programming, Vol. 106, 365-390, 2006.
·
Modeling
Change in a Health System: Implications on Patient Flows and Resource
Allocations.
E.D. Gunes and H. Yaman.
Clinical and Investigative Medicine, Vol. 28, 331-333, 2005.
·
Robust DWDM Routing and
Provisioning under Polyhedral Demand Uncertainty.
O.E. Karasan, M.C. Pinar, and H. Yaman.
Proceedings of INOC (International Network
Optimization Conference),
B1.242-B1.249, 2005.
·
Polyhedral
Analysis for the Uncapacitated Hub Location Problem with Modular Arc
Capacities.
H. Yaman.
SIAM Journal on Discrete Mathematics, Vol. 19, 501-522, 2005.
·
Solving
the Hub Location Problem with Modular Link Capacities.
H. Yaman and G. Carello.
Computers & Operations Research, Vol. 32, 3227-3245, 2005.
·
A
Branch and Cut Algorithm for Hub Location Problems with Single Assignment.
M. Labbe, H. Yaman, and E. Gourdin.
Mathematical Programming, Vol. 102, 371-405,
2005.
·
Concentrator
Location in Telecommunications Networks.
H. Yaman.
Springer, Combinatorial Optimization
Series, Vol. 16, 2005.
·
Bilkent
Universitesi Personel Tasima Sistemi icin Etkin ve Ekonomik Cozum.
V.A. Dincerler, N.E. Guven, M.M. Tanrikulu, M. Temel, M. Yitmen, and H.
Yaman.
Endustri
Muhendisligi, Vol. 15(2), 2-14, 2004.
·
Projecting
the Flow Variables for Hub Location Problems.
M.
Labbe and H. Yaman.
Networks,
Vol. 44, 84-93, 2004.
·
Concentrator
Location in Telecommunications, Ph.D. Thesis Abstract.
H.
Yaman.
4OR,
Vol. 2, 175-177, 2004.
·
Telecommunication
and Location.
E.
Gourdin, M. Labbe, and H. Yaman.
In
Facility Location: Applications and
Theory, Z.Drezner and H.W. Hamacher (Eds.), Springer, 2002.
·
The Robust Spanning Tree Problem with Interval Data.
H. Yaman, O.E.
Karasan, and M.C. Pýnar.
Operations Research Letters, Vol.
29, 31-40, 2001.