The fixed-charge shortest-path problem

DOI10.1287/IJOC.1110.0469zbMATH Open1460.90055OpenAlexW2159339450MaRDI QIDQ2815469FDOQ2815469

Authors: Faramroze G. Engineer, G. L. Nemhauser, Martin W. P. Savelsbergh, Jin-Hwa Song 

Publication date: 29 June 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1110.0469

Recommendations

• An algorithm for the resource constrained shortest path problem
• scientific article; zbMATH DE number 1670670
• Solving resource constrained shortest path problems with LP-based methods
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• A penalty function heuristic for the resource constrained shortest path problem

zbMATH Keywords

dynamic programmingshortest pathfixed charge

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Communication networks in operations research (90B18)

Cites Work

• The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Shortest Path Problems with Resource Constraints
• A survey of results for sequencing problems with controllable processing times
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Exact solution of bin-packing problems using column generation and branch-and-bound
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
• Title not available (Why is that?)
• Modelling path flows for a combined ship routing and inventory management problem
• Vehicle routing with split deliveries
• Decomposition of a combined inventory and time constrained ship routing problem
• Solving Parallel Machine Scheduling Problems by Column Generation
• Exact methods for the knapsack problem and its generalizations
• Solving binary cutting stock problems by column generation and branch- and-bound
• Parallel machine scheduling by column generation
• A Combined Vehicle Routing and Inventory Allocation Problem
• Scheduling with controllable release dates and processing times: Makespan minimization
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
• Technical Note—The Multiperiod Knapsack Problem

Cited In (2)

• Cost projection methods for the shortest path problem with crossing costs
• An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem

This page was built for publication: The fixed-charge shortest-path problem

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