An Open-Source Implementation of the Critical-Line Algorithm for Portfolio Optimization.
- Published in:
- Algorithms, 2013, v. 6, n. 1, p. 169, doi. 10.3390/a6010169
- By:
- Publication type:
- Article
Works matching IS 19994893 AND DT 2013 AND VI 6 AND IP 1
Results: 11
1
2
Stable Multicommodity Flows.
- Published in:
- Algorithms, 2013, v. 6, n. 1, p. 161, doi. 10.3390/a6010161
- By:
- Publication type:
- Article
3
Algorithms for Non-Negatively Constrained Maximum Penalized Likelihood Reconstruction in Tomographic Imaging.
- Published in:
- Algorithms, 2013, v. 6, n. 1, p. 136, doi. 10.3390/a6010136
- By:
- Publication type:
- Article
4
A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree.
- Published in:
- Algorithms, 2013, v. 6, n. 1, p. 119, doi. 10.3390/a6010119
- By:
- Publication type:
- Article
5
Computing the Eccentricity Distribution of Large Graphs.
- Published in:
- Algorithms, 2013, v. 6, n. 1, p. 100, doi. 10.3390/a6010100
- By:
- Publication type:
- Article
6
Dubins Traveling Salesman Problem with Neighborhoods: A Graph-Based Approach.
- Published in:
- Algorithms, 2013, v. 6, n. 1, p. 84, doi. 10.3390/a6010084
- By:
- Publication type:
- Article
7
Tractabilities and Intractabilities on Geometric Intersection Graphs.
- Published in:
- Algorithms, 2013, v. 6, n. 1, p. 60, doi. 10.3390/a6010060
- By:
- Publication type:
- Article
8
Computational Study on a PTAS for Planar Dominating Set Problem.
- Published in:
- Algorithms, 2013, v. 6, n. 1, p. 43, doi. 10.3390/a6010043
- By:
- Publication type:
- Article
9
Energy Efficient Routing in Wireless Sensor Networks Through Balanced Clustering.
- Published in:
- Algorithms, 2013, v. 6, n. 1, p. 29, doi. 10.3390/a6010029
- By:
- Publication type:
- Article
10
ℓ<sup>1</sup> Major Component Detection and Analysis (ℓ<sup>1</sup> MCDA): Foundations in Two Dimensions.
- Published in:
- Algorithms, 2013, v. 6, n. 1, p. 12, doi. 10.3390/a6010012
- By:
- Publication type:
- Article
11
Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability.
- Published in:
- Algorithms, 2013, v. 6, n. 1, p. 1, doi. 10.3390/a6010001
- By:
- Publication type:
- Article