A decomposition approach for commodity pickup and delivery with time-windows under uncertainty

DOI10.1007/s10951-013-0317-1zbMath1305.90194OpenAlexW2016569300MaRDI QIDQ490359

Cynthia Barnhart, Lavanya Marla, Varun Biyani

Publication date: 22 January 2015

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/89058

zbMATH Keywords

uncertaintydecompositionmulti-commodity routing and schedulingrobust routing and scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The pickup and delivery problem with time windows
• An algorithm for finding a maximum clique in a graph
• Robust solutions of uncertain linear programs
• On finding the strongly connected components in a directed graph
• Robust discrete optimization and network flows
• Robust solutions of linear programming problems contaminated with uncertain data
• Chance-Constrained Programming
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
• Robust Capacity Planning Under Uncertainty
• The Price of Robustness
• Investment in stochastic minimum cost generalized multicommodity networks with application to coal transport
• Introduction to Stochastic Programming
• A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
• Robust capacity expansion of network flows
• Depth-First Search and Linear Graph Algorithms
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints