Mathematical programming approaches for classes of random network problems

DOI10.1016/J.EJOR.2015.03.021zbMATH Open1346.90209DBLPjournals/eor/CastroN15OpenAlexW1964422875WikidataQ56267070 ScholiaQ56267070MaRDI QIDQ319592FDOQ319592

Authors: Jordi Castro, Stefano Nasini 

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/81111

Recommendations

• A Random Activity Network Generator
• Generating random networks from a given distribution
• Generation of networks with prescribed degree-dependent clustering
• Rangen: A random network generator for activity-on-the-node networks
• Generating random networks without short cycles

zbMATH Keywords

integer programminginterior-point methodscomplex networkscentral pathtotal unimodularity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Interior-point methods (90C51) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Integer programming (90C10)

Cites Work

• A Specialized Interior-Point Algorithm for Multicommodity Network Flows
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Modeling centrality measures in social network analysis using bi-criteria network flow optimization problems
• Combinatorial Properties of Matrices of Zeros and Ones
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decomposition techniques in mathematical programming. Engineering and science applications.
• Quadratic regularizations in an interior-point method for primal block-angular problems
• Applying relation algebra and RelView to measures in a social network
• Enumeration and simulation methods for 0-1 matrices with given marginals
• Random generation of tournaments and asymmetric graphs with given out-degrees
• Linear optimization and extensions.
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• An interior-point approach for primal block-angular problems
• Measure-centering ultrafilters
• Title not available (Why is that?)
• Title not available (Why is that?)
• The structure and function of networks
• An efficient MCMC algorithm to sample binary matrices with fixed marginals

Cited In (7)

• On geometrical properties of preconditioners in IPMs for classes of block-angular problems
• Représentation de matrices euclidiennes en vue de leur génération aléatoire
• Pairwise influences in dynamic choice: network-based model and application
• Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST)
• Generation of networks with prescribed degree-dependent clustering
• A Random Activity Network Generator
• A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method

Uses Software

• IPM

This page was built for publication: Mathematical programming approaches for classes of random network problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319592)