Similar Search Results

Kleinberg, Jon; Ligett, Katrina - In: Games and economic behavior 82 (2013), pp. 702-716

Persistent link: https://www.econbiz.de/10010243648

A biased random-key genetic algorithm for the capacitated minimum spanning tree problem

Ruiz, Efrain; Albareda-Sambola, Maria; Fernández, Elena; … - In: Computers & operations research : and their … 57 (2015), pp. 95-108

Persistent link: https://www.econbiz.de/10010495397

Estimation of graphical models using the L1,2 norm

Chiong, Khai Xiang; Moon, Hyungsik Roger - In: The econometrics journal 21 (2018) 3, pp. 247-263

Persistent link: https://www.econbiz.de/10012166618

ON THE MORPHOLOGICAL STRUCTURE OF A NETWORK

VANHOUCKE, M.; COELHO, J.; TAVARES, L. V.; DEBELS, D. - Faculteit Economie en Bedrijfskunde, Universiteit Gent - 2004

In literature, both morphological and resource-related measures are used to predict the difficulty of a project scheduling problem. Rapid progress regarding solution procedures has resulted in the development of a number of data generators in order to generate instances under a controlled design...

Persistent link: https://www.econbiz.de/10004982821

A Bi-Population Based Genetic Algorithm for the Resource-Constrained Project Scheduling Problem

Debels, Dieter; Vanhoucke, Mario - Vlerick Business School - 2005

The resource-constrained project scheduling problem (RCPSP) is one of the most challenging problems in project scheduling. During the last couple of years many heuristic procedures have been developed for this problem, but still these procedures often fail in finding near-optimal solutions for...

Persistent link: https://www.econbiz.de/10005405389

Information-sharing in social networks

Kleinberg, Jon; Ligett, Katrina - In: Games and Economic Behavior 82 (2013) C, pp. 702-716

We present a new model for reasoning about the way information is shared among friends in a social network and the resulting ways in which the social network fragments. Our model formalizes the intuition that revealing personal information in social settings involves a trade-off between the...

Persistent link: https://www.econbiz.de/10011049729

Efficiency of star-like graphs and the Atlanta subway network

Ek, Bryan; VerSchneider, Caitlin; Narayan, Darren A. - In: Physica A: Statistical Mechanics and its Applications 392 (2013) 21, pp. 5481-5489

The distance d(i,j) between any two vertices i and j in a graph is the number of edges in a shortest path between i and j. If there is no path connecting i and j, then d(i,j)=∞. In 2001, Latora and Marchiori introduced the measure of efficiency between vertices in a graph (Latora and...

Persistent link: https://www.econbiz.de/10011059787

Percolation in networks with long-range connections

Moukarzel, Cristian F. - In: Physica A: Statistical Mechanics and its Applications 372 (2006) 2, pp. 340-345

topologically similar to random graphs. Percolation on these networks is numerically studied for systems of up to 107 sites. The …

Persistent link: https://www.econbiz.de/10011060388

Effective dimensions in networks with long-range connections

Moukarzel, Cristian F. - In: Physica A: Statistical Mechanics and its Applications 356 (2005) 1, pp. 157-161

networks topologically similar to random graphs. An effective dimension dchem(μ) can be defined in terms of the shortest …

Persistent link: https://www.econbiz.de/10011062380

Ising model with spins S=1/2 and 1 on directed and undirected Erdös–Rényi random graphs

Lima, F.W.S.; Sumour, M.A. - In: Physica A: Statistical Mechanics and its Applications 391 (2012) 4, pp. 948-953

–Rényi (ER) random graphs, with z neighbors for each spin. In the case with spin S=1/2, the undirected and directed ER graphs … graphs the model presents a spontaneous magnetization at p=z/N(z=2,3,…,N), but no spontaneous magnetization at p=1/N which is … the percolation threshold. For both directed and undirected ER graphs with spin S=1, we find a first-order phase …

Persistent link: https://www.econbiz.de/10011063450