Network design and alliance formation for liner shipping

[1]  Özlem Ergun,et al.  Ship Scheduling and Network Design for Cargo Routing in Liner Shipping , 2008, Transp. Sci..

[2]  George Liu,et al.  Profit Optimization for Container Carriers , 2007 .

[3]  Lori Marie Houghtalen,et al.  Designing Allocation Mechanisms for Carrier Alliances , 2007 .

[4]  Joaquín Sánchez-Soriano,et al.  Pairwise solutions and the core of transportation situations , 2006, Eur. J. Oper. Res..

[5]  Kjetil Fagerholt,et al.  Ship Routing and Scheduling: Status and Perspectives , 2004, Transp. Sci..

[6]  Peter Värbrand,et al.  The Heterogeneous Vehicle - Routing Game , 2004, Transp. Sci..

[7]  Evangelos Markakis,et al.  On the core of the multicommodity flow game , 2003, EC '03.

[8]  Dushyant Sharma,et al.  A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem , 2003, Oper. Res. Lett..

[9]  Dong-Wook Song,et al.  A conceptual application of cooperative game theory to liner shipping strategic alliances , 2002 .

[10]  B. Slack,et al.  Strategic alliances in the container shipping industry: a global perspective , 2002 .

[11]  Subhash Suri,et al.  Vickrey prices and shortest paths: what is an edge worth? , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[12]  Ravindra K. Ahuja,et al.  Inverse Optimization , 2001, Oper. Res..

[13]  Vijay V. Vazirani,et al.  Applications of approximation algorithms to cooperative games , 2001, STOC '01.

[14]  Tim Roughgarden,et al.  How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[15]  Robert B. Dial,et al.  MINIMAL-REVENUE CONGESTION PRICING PART II: AN EFFICIENT ALGORITHM FOR THE GENERAL CASE , 2000 .

[16]  Jean-François Cordeau,et al.  Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling , 2000, Transp. Sci..

[17]  Martin Skutella,et al.  Cooperative facility location games , 2000, SODA '00.

[18]  R. Midoro,et al.  A critical evaluation of strategic alliances in liner shipping , 2000 .

[19]  Herbert Hamers,et al.  On some balanced, totally balanced and submodular delivery games , 1999, Math. Program..

[20]  Helen A. Thanopoulou,et al.  Liner alliances in the globalization era: a strategic tool for Asian container carriers , 1999 .

[21]  Kjetil Fagerholt,et al.  Optimal fleet design in a ship routing problem , 1999 .

[22]  Noam Nisan,et al.  Algorithmic mechanism design (extended abstract) , 1999, STOC '99.

[23]  A. F. Stent,et al.  LONGHAUL FEEDER SERVICES IN AN ERA OF CHANGING TECHNOLOGY: AN ASIA-PACIFIC PERSPECTIVE , 1999 .

[24]  Jean-François Cordeau,et al.  Simultaneous Assignment of Locomotives and Cars to Passenger Trains , 1998, Oper. Res..

[25]  Jean-François Cordeau,et al.  A Benders Decomposition Approach for the Locomotive and Car Assignment Problem , 1998, Transp. Sci..

[26]  Marielle Christiansen,et al.  A method for solving ship routing problemswith inventory constraints , 1998, Ann. Oper. Res..

[27]  Chuen-Yih Chen,et al.  A Two-Stage Stochastic Network Model and Solution Methods for the Dynamic Empty Container Allocation Problem , 1998, Transp. Sci..

[28]  Martin W. P. Savelsbergh,et al.  A Branch-and-Price Algorithm for the Generalized Assignment Problem , 1997, Oper. Res..

[29]  Herbert Hamers,et al.  On the concavity of delivery games , 1997 .

[30]  Russ J. Vander Wiel,et al.  An exact solution approach for the time‐dependent traveling‐salesman problem , 1996 .

[31]  Peter Värbrand,et al.  On the nucleolus of the basic vehicle routing game , 1996, Math. Program..

[32]  C. M. Khoong,et al.  A DSS for empty container distribution planning , 1995, Decis. Support Syst..

[33]  Cynthia Barnhart,et al.  A column-generation technique for the long-haul crew-assignment problem , 1994 .

[34]  David Ronen,et al.  Ship scheduling: The last decade , 1993 .

[35]  Mikio Kubo,et al.  ON THE CORE OF THE NETWORK DESIGN GAME , 1992 .

[36]  Krishan Rana,et al.  Routing Container Ships Using Lagrangean Relaxation and Decomposition , 1991, Transp. Sci..

[37]  Moshe Dror,et al.  Cost allocation: the traveling salesman, binpacking, and the knapsack , 1990 .

[38]  Dov Samet,et al.  On the Core and Dual Set of Linear Programming Games , 1984, Math. Oper. Res..

[39]  D Ronen,et al.  CARGO SHIPS ROUTING AND SCHEDULING: SURVEY OF MODELS AND PROBLEMS. IN: MARITIME TRANSPORT , 1983 .

[40]  Eitan Zemel,et al.  Generalized Network Problems Yielding Totally Balanced Games , 1982, Oper. Res..

[41]  Eitan Zemel,et al.  Totally Balanced Games and Games of Flow , 1982, Math. Oper. Res..

[42]  M. D. Devine,et al.  A Modified Benders' Partitioning Algorithm for Mixed Integer Programming , 1977 .

[43]  Michael Florian,et al.  The engine scheduling problem in a railway network , 1976 .

[44]  Guillermo Owen,et al.  On the core of linear production games , 1975, Math. Program..

[45]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[46]  L. Shapley,et al.  The assignment game I: The core , 1971 .

[47]  L. Shapley.  Cores of convex games , 1971 .

[48]  Dyneley Hussey,et al.  Annals of Opera , 1943 .

[49]  Özlem Ergun,et al.  Collaboration in Cargo Transportation , 2009 .

[50]  Akio Imai,et al.  The economic viability of container mega-ships , 2006 .

[51]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[52]  Dan Rosen,et al.  The practice of portfolio replication. A practical overview of forward and inverse problems , 1999, Ann. Oper. Res..

[53]  J. Stoer.  Numerische Mathematik 1 , 1989 .

[54]  Stef Tijs,et al.  Stable outcomes for multi-commodity flow games , 1985 .

[55]  Lloyd S. Shapley,et al.  On balanced sets and cores , 1967 .

[56]  H. Scarf.  The Core of an N Person Game , 1967 .