A novel reformulation for the single-sink fixed-charge transportation problem

DOI10.1007/s10107-023-01930-yzbMath1522.90038OpenAlexW4320039432MaRDI QIDQ6052058

Robin Legault, Jean-François Côté, Bernard Gendron

Publication date: 23 October 2023

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-023-01930-y

zbMATH Keywords

Lagrangian relaxationknapsack problemmixed-integer programmingfixed-charge transportation problem

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• Where are the hard knapsack problems?
• Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
• Exact algorithm for solving a special fixed-charge linear programming problem
• Algorithms for solving the single-sink fixed-charge transportation problem
• Note. An Acquisition Policy for a Single Item Multi-Supplier System
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• An Algorithm for Large Zero-One Knapsack Problems
• Fast Algorithms for Single-Sink Fixed Charge Transportation Problems with Applications to Manufacturing and Transportation
• A Minimal Algorithm for the 0-1 Knapsack Problem
• Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
• A Minimal Algorithm for the Bounded Knapsack Problem

This page was built for publication: A novel reformulation for the single-sink fixed-charge transportation problem