Narrow search
Showing 1 - 10 of 2,940
Cover Image
An optimal algorithm for counting network motifs
Itzhack, Royi; Mogilevski, Yelena; Louzoun, Yoram - In: Physica A: Statistical Mechanics and its Applications 381 (2007) C, pp. 482-490
networks microscopic details. The commonly used algorithm for counting small-scale motifs is the one developed by Milo et al …. This algorithm is extremely costly in CPU time and actually cannot work on large networks, consisting of more than 100 …
Persistent link: https://www.econbiz.de/10010871718
Cover Image
Benders, metric and cutset inequalities for multicommodity capacitated network design
Costa, Alysson; Cordeau, Jean-François; Gendron, Bernard - In: Computational Optimization and Applications 42 (2009) 3, pp. 371-392
Persistent link: https://www.econbiz.de/10005169142
Cover Image
Organizing Contests for Status: The Matthew Effect vs. the Mark Effect
Bothner, Matthew S.; Podolny, Joel M.; Smith, Edward Bishop - In: Management Science 57 (2011) 3, pp. 439-457
accepted by Olav Sorenson, organizations and social networks. …
Persistent link: https://www.econbiz.de/10009191403
Cover Image
Introduction to Connections: An Introduction to the Economics of Networks
Goyal, Sanjeev - Princeton University Press
economic phenomena. Standard economic theory did not give much credit to the role of networks until the early 1990s, but since … then the study of the theory of networks has blossomed. At the heart of this research is the idea that the pattern of … mathematical proofs, <i>Connections</i> is a concise and self-contained treatment of the economic theory of networks, one that …
Persistent link: https://www.econbiz.de/10005696689
Cover Image
A prototype column generation strategy for the multiple container loading problem
Zhu, Wenbin; Huang, Weili; Lim, Andrew - In: European Journal of Operational Research 223 (2012) 1, pp. 27-39
The multiple container loading cost minimization problem (MCLCMP) is a practical and useful problem in the transportation industry, where products of various dimensions are to be loaded into containers of various sizes so as to minimize the total shipping cost. The MCLCMP can be naturally...
Persistent link: https://www.econbiz.de/10010597634
Cover Image
Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges
Cerulli, R.; De Donato, R.; Raiconi, A. - In: European Journal of Operational Research 220 (2012) 1, pp. 58-66
Wireless sensor networks involve many different real-world contexts, such as monitoring and control tasks for traffic …
Persistent link: https://www.econbiz.de/10010597700
Cover Image
Real-time freight locomotive rescheduling and uncovered train detection during disruption
Sato, Keisuke; Fukumura, Naoto - In: European Journal of Operational Research 221 (2012) 3, pp. 636-648
This paper discusses rescheduling of freight train locomotives when dealing with a disrupted situation in the daily operations in Japan. Within the current framework of dispatching processes, passenger railway operators modify the entire timetables and an adjusted freight train timetable is...
Persistent link: https://www.econbiz.de/10010597704
Cover Image
Investment in electricity networks with transmission switching
Villumsen, J.C.; Philpott, A.B. - In: European Journal of Operational Research 222 (2012) 2, pp. 377-385
capacity planning of electricity transmission networks that have some switchable transmission elements. The decomposition … enables a column-generation algorithm to be applied, which allows the solution of large problem instances. The methodology is … for an existing network. Computational tests on IEEE test networks with 73 nodes and 118 nodes confirm the efficiency of …
Persistent link: https://www.econbiz.de/10010597713
Cover Image
A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
Cattrysse, Dirk; Salomon, Marc; Kuik, Roelof; … - In: Management Science 39 (1993) 4, pp. 477-486
In this paper the Discrete Lotsizing and Scheduling Problem (DLSP) with setup times is considered. DLSP is the problem of determining the sequence and size of production batches for multiple items on a single machine. The objective is to find a minimal cost production schedule such that dynamic...
Persistent link: https://www.econbiz.de/10009203826
Cover Image
An Optimization Based Heuristic for Political Districting
Mehrotra, Anuj; Johnson, Ellis L.; Nemhauser, George L. - In: Management Science 44 (1998) 8, pp. 1100-1114
Redistricting, the redrawing of congressional district boundaries within the states, may occur every 10 years on the basis of the population census. Many redistricting plans are designed with partisan politics in mind, resulting in disputes and forcing judges to intervene. We address this...
Persistent link: https://www.econbiz.de/10009204059