The 2-path network problem
From MaRDI portal
Publication:4474295
DOI10.1002/net.20003zbMath1053.90011OpenAlexW2061552894MaRDI QIDQ4474295
Publication date: 4 August 2004
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20003
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Directed graphs (digraphs), tournaments (05C20)
Related Items (11)
A hybrid data mining GRASP with path-relinking ⋮ Robustness and Strong Attack Tolerance of Low-Diameter Networks ⋮ Combining integer linear programming with a state‐of‐the‐art heuristic for the 2‐path network design problem ⋮ The \(k\) edge-disjoint 3-hop-constrained paths polytope ⋮ Extending time‐to‐target plots to multiple instances ⋮ On the \(k\) edge-disjoint 2-hop-constrained paths polytope ⋮ Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms ⋮ Probabilistic stopping rules for GRASP heuristics and extensions ⋮ Optimal expansion of a heated working fluid for maximum work output with time-dependent heat conductance and generalized radiative heat transfer law ⋮ Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks ⋮ Placing Green bridges optimally, with a multivariate analysis
Cites Work
This page was built for publication: The 2-path network problem
