The Fixed-Charge Shortest-Path Problem
From MaRDI portal
Publication:2815469
DOI10.1287/ijoc.1110.0469zbMath1460.90055OpenAlexW2159339450MaRDI QIDQ2815469
Savelsbergh, Martin W. P., Jin-Hwa Song, Faramroze Engineer, Nemhauser, George I.
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
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Dynamic programming (90C39)
Related Items
Cites Work
- Unnamed Item
- A survey of results for sequencing problems with controllable processing times
- Exact methods for the knapsack problem and its generalizations
- Modelling path flows for a combined ship routing and inventory management problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Solving binary cutting stock problems by column generation and branch- and-bound
- Vehicle routing with split deliveries
- Scheduling with controllable release dates and processing times: Makespan minimization
- Parallel Machine Scheduling by Column Generation
- Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem
- The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
- A Combined Vehicle Routing and Inventory Allocation Problem
- Technical Note—The Multiperiod Knapsack Problem
- Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Solving Parallel Machine Scheduling Problems by Column Generation
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Shortest Path Problems with Resource Constraints
