Franco Robledo

From MaRDI portal
Person:258750

Available identifiers

zbMath Open robledo.francoMaRDI QIDQ258750

List of research outcomes





PublicationDate of PublicationType
Silvopastoral and agroforestry systems: an integer linear programming model for investment decisions2023-12-12Paper
On the reliability estimation of stochastic binary systems2023-11-27Paper
Complexity and heuristics for the weighted max cut‐clique problem2023-11-24Paper
Graph fragmentation problem: analysis and synthesis2023-11-15Paper
https://portal.mardi4nfdi.de/entity/Q51526502021-09-24Paper
A formulation for a hop constrained survivable network design problem2021-05-03Paper
The capacitated m two node survivable star problem2021-05-03Paper
Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems2021-02-09Paper
Finding uniformly most reliable graphs by counting trivial cuts2020-12-08Paper
https://portal.mardi4nfdi.de/entity/Q45779302018-08-06Paper
Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior2018-05-23Paper
Metaheuristic approaches for IP/MPLS network design2018-05-22Paper
Two‐node‐connected star problem2018-05-22Paper
Complexity among combinatorial problems from epidemics2018-03-16Paper
A Q-Learning Approach for Investment Decisions2018-03-09Paper
Diameter constrained reliability of ladders and Spanish fans2017-07-19Paper
Resilient overlay design in DWDM systems2017-07-19Paper
Capacitated \(m\) two-node survivable star problem2016-10-18Paper
Full complexity analysis of the diameter-constrained reliability2016-05-18Paper
Nash equilibrium in evolutionary competitive models of firms and workers under external regulation2016-03-10Paper
Analysis and design of peer‐assisted video‐on‐demand services2015-02-25Paper
An ant-colony approach for the design of optimal chunk scheduling policies in live peer-to-peer networks2015-02-23Paper
Using GRASP for designing a layered network: a real IP/MPLS over DWDM application case2015-02-23Paper
Efficient estimation of distance‐dependent metrics in edge‐failing networks2014-05-15Paper
The complexity of computing the 2-K-reliability in networks2014-05-05Paper
On computing the 2‐diameter ‐constrained K ‐reliability of networks2013-05-23Paper
On the Complexity of the Classification of Synchronizing Graphs2011-04-14Paper
On the Generalized Steiner Problem with Network Reliability Conditions2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q57084902005-11-18Paper

Research outcomes over time

This page was built for person: Franco Robledo