On the directed hop-constrained shortest path problem

No abstract is available for this paper.

• Publication year

  2004

• Venue

  Operations Research Letters

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/S0167-6377(03)00026-9
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Using a Hop-Constrained Model to Generate Alternative Communication Network Design

  2015cited by this paper
• The cardinality-constrained shortest path problem in 2-graphs

  2000cited by this paper
• Notes on polyhedra associated with hop-constrained paths

  1999cited by this paper
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints

  1998cited by this paper
• Curve approximation and constrained shortest path problems

  1996cited by this paper
• Integer and Combinatorial Optimization

  1988cited by this paper
• Theory of Linear and Integer Programming

  1987cited by this paper

• Optimization algorithms for the k edge-connected L-hop-constrained network design problem

  2024cites this paper
• Bellman-Ford is optimal for shortest hop-bounded paths

  2022cites this paper
• The location and location-routing problem for the refugee camp network design

  2021cites this paper
• A polyhedral study of the diameter constrained minimum spanning tree problem

  2020cites this paper
• A Dynamic Neural Network for Solving Time-varying Shortest Path with Hop-constraint

  2020cites this paper
• The feasible region for consecutive patterns of permutations is a cycle polytope

  2019cites this paper
• Planning Public Services under Imminent Humanitarian Crises

  2019influential citation
• k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut

  2018cites this paper
• Parallelisation of hybrid metaheuristics for COP solving

  2018cites this paper
• Long-term area coverage and radio relay positioning using swarms of UAVs

  2018cites this paper
• The 2 edge-disjoint 3-paths polyhedron

  2018cites this paper
• The MinSum-MinHop and the MaxMin-MinHop Bicriteria Path Problems

  2018cites this paper
• Container shipping service selection and cargo routing with transshipment limits

  2017cites this paper
• Optimal Network Design with End-to-End Service Requirements

  2017cites this paper
• The 2 edge-disjoint 3-paths polyhedron

  2017cites this paper
• The Survivable Network Design Problems with High Node-Connectivity Constraints : Polyhedra and Algorithms. (Conception de réseaux fiables avec fortes contraintes de sommet-connexité : Étude polyédrale et Algorithmes)

  2017influential citation
• A parallel hybrid optimization algorithm for some network design problems

  2017cites this paper
• Structural properties of graphs and eficient algorithms: Problems Between Parameters

  2017cites this paper
• A complete characterization of jump inequalities for the hop-constrained shortest path problem

  2017cites this paper
• Integer programming formulations for the k‐edge‐connected 3‐hop‐constrained network design problem

  2016influential citation
• A Parallel Hybrid Genetic Algorithm for the k-Edge-Connected Hop-Constrained Network Design Problem

  2016cites this paper
• Two node‐disjoint hop‐constrained survivable network design and polyhedra

  2016influential citation
• Discrete particle swarm optimization for combinatorial problems with innovative applications.

  2016cites this paper
• Parameterized Complexity of Length-bounded Cuts and Multicuts

  2015cites this paper
• Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem

  2015cites this paper
• Methods for Network Optimization and Parallel Derivative-free Optimization

  2014cites this paper
• Research of UAV communication relay deployment problems in target reconnaissance mission

  2014cites this paper
• Hop-constrained tree-shaped networks 1

  2013cites this paper
• Benders Decomposition for the Hop-Constrained Survivable Network Design Problem

  2013cites this paper
• Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks

  2012cites this paper
• Composition of graphs and the Hop-constrained Path Problem

  2012influential citation
• Partition Inequalities: Separation, Extensions and Network Design,

  2011influential citation
• IBM Research Report Partition Inequalities : Separation , Extensions and Network Design

  2011influential citation
• Enhancing discretized formulations: the knapsack reformulation and the star reformulation

  2011cites this paper
• Heuristic Methods for the Hop Constrained Survivable Network Design Problem

  2011cites this paper
• The k edge-disjoint 3-hop-constrained paths polytope

  2010cites this paper
• Benders decomposition for the hop-constrainted survivable network design problem

  2010cites this paper
• Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation

  2010cites this paper
• Relay Positioning for Unmanned Aerial Vehicle Surveillance*

  2010cites this paper
• Polyhedral aspects of cardinality constrained combinatorial optimization problems

  2009influential citation
• Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009

  2009cites this paper
• Lagrangian Relax-and-Cut and Hybrid Methods for the Bounded Diameter and the Hop Constrained Minimum Spanning Tree Problems

  2008cites this paper
• Extended Node-Arc Formulations for the K-Edge Disjoint Hop-Constrained Network Design Problem

  2008cites this paper
• Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints

  2007cites this paper
• The dynamic, resource-constrained shortest path problem on an acyclic graph with application in column generation and literature review on sequence-dependent scheduling

  2007influential citation
• On cardinality constrained cycle and path polytopes

  2007cites this paper
• Integer programming formulations for the two 4‐hop‐constrained paths problem

  2007influential citation
• Subgradient Optimization Based Lagrangian Relaxation and Relax-and-Cut Approaches for the Bounded-Diameter Minimum Spanning Tree Problem

  2007cites this paper
• Uniformly optimal digraphs for strongly connected reliability

  2007cites this paper
• The two‐edge connected hop‐constrained network design problem: Valid inequalities and branch‐and‐cut

  2007cites this paper
• On the k edge-disjoint 2-hop-constrained paths polytope

  2006cites this paper
• Compact Models for Hop-Constrained Node Survivable Network Design: An Application to MPLS

  2006cites this paper
• On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem

  2006cites this paper
• Facets of the (s, t)-p-path polytope

  2006influential citation
• Computing a diameter-constrained minimum spanning tree

  2006cites this paper
• Polyhedral Approaches to the Design of Survivable Networks

  2006cites this paper
• Polytopes associated with length restricted directed circuits

  2005cites this paper
• Design of Survivable Networks: A survey

  2005influential citation
• A note on hop-constrained walk polytopes

  2004cites this paper
• Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Characterization of Facets of the Hop Constrained Chain Polytope via Dynamic Programming Characterization of Facets of the Hop Constrained Chain Polytope via Dynamic Programming

  year unknowninfluential citation