The 2-path network problem

DOI10.1002/NET.20003MaRDI QIDQ4474295zbMATH OpenOpenAlexFDO

Authors Geir Dahl, Bjarne Johannessen

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

zbMATH Keywords

cutting planesnetwork designpolyhedral approach

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Directed graphs (digraphs), tournaments (05C20) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• Path problems in networks
• The two layer network design problem
• On the 2-central path problem
• The Two-Unicast Problem
• The 2-hop spanning tree problem
• The problems of selecting an optimal path on network
• A problems of selecting a optimal path on network
• Path Problems in Complex Networks
• Min-sum 2-paths problems
• Min-sum 2-paths problems

Cites work

• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• Geometric algorithms and combinatorial optimization

Cited in

(20)

• Probabilistic stopping rules for GRASP heuristics and extensions
• Placing Green bridges optimally, with a multivariate analysis
• Optimal expansion of a heated working fluid for maximum work output with time-dependent heat conductance and generalized radiative heat transfer law
• The k edge-disjoint 3-hop-constrained paths polytope
• Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks
• Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
• Categorized bottleneck-minisum path problems on networks
• Increasing distances in graphs
• Balanced paths in acyclic networks: Tractable cases and related approaches
• A network design problem with two-edge matching failures
• Combining integer linear programming with a state‐of‐the‐art heuristic for the 2‐path network design problem
• Extending time-to-target plots to multiple instances
• A hybrid data mining GRASP with path-relinking
• Network optimization on partitioned pairs of points
• Placing green bridges optimally, with a multivariate analysis
• Robustness and strong attack tolerance of low-diameter networks
• On the \(k\) edge-disjoint 2-hop-constrained paths polytope
• On a Network Design Problem That Is Intractable on Trees
• The 2-hop spanning tree problem
• The anchored network covering problem

This page was built for publication: The 2-path network problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474295)