Scalable timing-aware network design via Lagrangian decomposition

DOI10.1016/j.ejor.2023.01.018MaRDI QIDQ6112744

Jochen Könemann, Cid Carvalho De Souza, Cristiana L. Lara, Yisu Nie

Publication date: 10 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

transportationLagrangian decompositiontask schedulingresource task networktemporal fixed-charge multi-commodity flow

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
• Mixed integer linear programming in process scheduling: modeling, algorithms, and applications
• Using aggregation to optimize long-term production planning at an underground mine
• Finding good approximate vertex and edge partitions is NP-hard
• Assignment and sequencing models for the scheduling of process systems
• Efficient continuous-time dynamic network flow algorithms
• Service network design in freight transportation
• Perspectives on integer programming for time-dependent models
• Multicommodity flows over time: Efficient algorithms and complexity
• Service network design for freight transportation: a review
• Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes
• Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
• An Introduction to Network Flows over Time
• Large-Scale, Less-than-Truckload Service Network Design
• Integer Programming
• Fixed-cost transportation problems
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• Multi-Terminal Network Flows
• Minimum-cost dynamic flows: The series-parallel case
• The Continuous-Time Service Network Design Problem
• Faster approximation schemes for fractional multicommodity flow problems
• Reducibility among Combinatorial Problems
• Time-Expanded Packings
• Network Flow Algorithms
• Constructing Maximal Dynamic Flows from Static Flows
• Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
• Quickest Flows Over Time
• The fixed charge problem
• Minimization of unsmooth functionals
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design