Paris, France
Paris, France

Time filter

Source Type

TAMPA, Fla., Feb. 16, 2017 /PRNewswire-USNewswire/ -- AACSB International (AACSB) announced today that Asia University-Taiwan (Chinese Taipei), ISC Paris (France), Johns Hopkins Carey Business School (United States), Soochow University (China), Universidad Carlos III de Madrid (Spain),...


Loussaief L.,ISC Paris | Cacho-Elizondo S.,IPADE Business School | Pettersen I.B.,Bergen University College | Tobiassen A.E.,Norwegian Business School
Journal of Retailing and Consumer Services | Year: 2014

This research explores how young consumers perceive Corporate Social Responsibility (CSR) actions of French and Norwegian food retailers, and how these actions affect brand image, brand associations (adjectives, verbs, and names) and consumer-retailer relationships. It uses a qualitative methodology with in-depth interviews. This exploratory study shows that French and Norwegian young consumers have problems linking CSR with food retailing, and they question retailers' true commitment to CSR. Young French consumers had stronger brand associations than young Norwegians. Therefore, we argue that, CSR commitment among retailers in both countries is likely to positively affect retailer brand image. Nevertheless, CSR related products could also be associated with higher prices and may exclude low-income consumers. © 2013 Elsevier Ltd.


Akeb H.,ISC Paris | Hifi M.,University of Picardie Jules Verne
World Academy of Science, Engineering and Technology | Year: 2010

In this paper, the use of beam search and look-ahead strategies for solving the strip packing problem (SPP) is investigated. Given a strip of fixed width W, unlimited length L, and a set of n circular pieces of known radii, the objective is to determine the minimum length of the initial strip that packs all the pieces. An augmented algorithm which combines beam search and a look-ahead strategies is proposed. The look-ahead is used in order to evaluate the nodes at each level of the tree search. The best nodes are then retained for branching. The computational investigation showed that the proposed augmented algorithm is able to improve the best known solutions of the literature on most instances used.

Loading ISC Paris collaborators
Loading ISC Paris collaborators