Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem

DOI10.1016/j.cor.2018.05.013zbMath1391.90614OpenAlexW2804972467MaRDI QIDQ1651640

Alexandre Salles da Cunha, Dilson Lucas Pereira

Publication date: 12 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.05.013

zbMATH Keywords

vehicle routingtreeswireless sensor networksparallel heuristicsrow and column generation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items

Layered graph approaches for combinatorial optimization problems

Uses Software

• VRP

Cites Work

• Efficient elementary and restricted non-elementary route pricing
• Load-dependent and precedence-based models for pickup and delivery problems
• Traveling salesman problem heuristics: leading methods, implementations and latest advances
• The vehicle routing problem: An overview of exact and approximate algorithms
• Multicommodity flow models for spanning trees with hop constraints
• Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
• Branching rules revisited
• Accelerated label setting algorithms for the elementary resource constrained shortest path problem
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• The Minimum Cost Hop-and-root constrained forest in Wireless Sensor Networks
• Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem
• The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
• Decomposition Principle for Linear Programs
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• Solving the Orienteering Problem through Branch-and-Cut
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Shortest Path Problems with Resource Constraints
• Steiner's problem in graphs and its implications
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item