The following pages link to Eduardo L. Pasiliao (Q276863):
Displaying 50 items.
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- Exact solution approaches for bilevel assignment problems (Q276866) (← links)
- Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
- In and out forests on combinatorial landscapes (Q299842) (← links)
- Minimum edge blocker dominating set problem (Q319914) (← links)
- An exact algorithm for the maximum probabilistic clique problem (Q405671) (← links)
- On risk-averse maximum weighted subgraph problems (Q405680) (← links)
- An integer programming framework for critical elements detection in graphs (Q405684) (← links)
- Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra (Q486728) (← links)
- On Laplacian spectra of parametric families of closely connected networks with application to cooperative control (Q506453) (← links)
- A simple greedy heuristic for linear assignment interdiction (Q513608) (← links)
- Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios (Q513625) (← links)
- Finding clique clusters with the highest betweenness centrality (Q724070) (← links)
- (Q812419) (redirect page) (← links)
- Asymptotic results for random multidimensional assignment problems (Q812420) (← links)
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem (Q829202) (← links)
- Containment control for a social network with state-dependent connectivity (Q889007) (← links)
- On the hierarchical optimal control of a chain of distributed systems (Q900841) (← links)
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (Q1640044) (← links)
- Stochastic decision problems with multiple risk-averse agents (Q1695076) (← links)
- An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming (Q1704917) (← links)
- (Q1756798) (redirect page) (← links)
- A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique (Q1756799) (← links)
- Application of graph-theoretic approaches to the random landscapes of the three-dimensional assignment problem (Q1936794) (← links)
- On exact solution approaches for the longest induced path problem (Q1999389) (← links)
- Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks (Q2015788) (← links)
- Potential energy principles in networked systems and their connections to optimization problems on graphs (Q2018871) (← links)
- Multidimensional assignment problem for multipartite entity resolution (Q2079699) (← links)
- A study of feature representation via neural network feature extraction and weighted distance for clustering (Q2084665) (← links)
- A polyhedral approach to least cost influence maximization in social networks (Q2111478) (← links)
- Networks of causal relationships in the U.S. stock market (Q2148732) (← links)
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
- Minimum vertex cover problem for coupled interdependent networks with cascading failures (Q2255970) (← links)
- Integer programming models for the multidimensional assignment problem with star costs (Q2256320) (← links)
- Critical nodes in interdependent networks with deterministic and probabilistic cascading failures (Q2274858) (← links)
- A cutting plane method for risk-constrained traveling salesman problem with random arc costs (Q2274859) (← links)
- An integer programming approach for finding the most and the least central cliques (Q2341092) (← links)
- Optimization of discrete broadcast under uncertainty using conditional value-at-risk (Q2439489) (← links)
- Exact identification of critical nodes in sparse networks via new compact formulations (Q2448196) (← links)
- Graph partitions for the multidimensional assignment problem (Q2450905) (← links)
- Efficient methods for the distance-based critical node detection problem in complex networks (Q2668688) (← links)
- (Q2752038) (← links)
- An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets (Q2942693) (← links)
- (Q3002967) (← links)
- A Scenario Decomposition Algorithm for Stochastic Programming Problems with a Class of Downside Risk Measures (Q3466784) (← links)
- Detecting resilient structures in stochastic networks: A two‐stage stochastic optimization approach (Q4565783) (← links)
- Critical arcs detection in influence networks (Q4584871) (← links)
- Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
- Minimum vertex blocker clique problem (Q4642478) (← links)
- Fortification Against Cascade Propagation Under Uncertainty (Q5084610) (← links)
