Personal information

No personal information available

Activities

Collapse all

Works (11)

Application of graph-theoretic approaches to the random landscapes of the three-dimensional assignment problem

Journal article
DOI:

10.1007/s11590-011-0396-x
Source: Self-asserted source
Eduardo Pasiliao

Asymptotic Results for Random Multidimensional Assignment Problems

Journal article
DOI:

10.1007/s10589-005-3227-0
Source: Self-asserted source
Eduardo Pasiliao

Computational Studies of Randomized Multidimensional Assignment Problems

Book chapter
DOI:

10.1007/978-1-4614-3906-6_12
Source: Self-asserted source
Eduardo Pasiliao

Exact identification of critical nodes in sparse networks via new compact formulations

Journal article
DOI:

10.1007/s11590-013-0666-x
Source: Self-asserted source
Eduardo Pasiliao

Local search heuristics for the multidimensional assignment problem

Book chapter
DOI:

10.1007/s10732-010-9133-3
Source: Self-asserted source
Eduardo Pasiliao

Minimum-Risk Maximum Clique Problem

Book chapter
DOI:

10.1007/978-1-4614-7582-8_8
Source: Self-asserted source
Eduardo Pasiliao

Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks

Journal article
DOI:

10.1007/s10878-012-9523-6
Source: Self-asserted source
Eduardo Pasiliao

Optimization of discrete broadcast under uncertainty using conditional value-at-risk

Journal article
DOI:

10.1007/s11590-012-0542-0
Source: Self-asserted source
Eduardo Pasiliao

Optimizing Network Topology to Reduce Aggregate Traffic in Systems of Mobile Agents

Book chapter
DOI:

10.1007/978-1-4614-5574-5_8
Source: Self-asserted source
Eduardo Pasiliao

Throughput Maximization in CSMA Networks with Collisions and Hidden Terminals

Book chapter
DOI:

10.1007/978-1-4614-3906-6_10
Source: Self-asserted source
Eduardo Pasiliao

Transient Stochastic Models for Search Patterns

Book chapter
DOI:

10.1007/978-1-4757-6594-6_12
Source: Self-asserted source
Eduardo Pasiliao
How many people are using ORCID?