Mathematical programming approaches for classes of random network problems
From MaRDI portal
Publication:319592
DOI10.1016/j.ejor.2015.03.021zbMath1346.90209OpenAlexW1964422875WikidataQ56267070 ScholiaQ56267070MaRDI QIDQ319592
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
Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Integer programming (90C10) Interior-point methods (90C51) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems, Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST), A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method, Pairwise influences in dynamic choice: network-based model and application
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quadratic regularizations in an interior-point method for primal block-angular problems
- The structure and function of networks
- An efficient MCMC algorithm to sample binary matrices with fixed marginals
- 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
- Modeling centrality measures in social network analysis using bi-criteria network flow optimization problems
- An interior-point approach for primal block-angular problems
- Combinatorial Properties of Matrices of Zeros and Ones
- A Specialized Interior-Point Algorithm for Multicommodity Network Flows