The transportation problem with packing constraints

DOI10.1016/j.cor.2023.106278OpenAlexW4376274773MaRDI QIDQ6106585

Tulay Flamand, Mohamed Haouari, Manuel Iori

Publication date: 3 July 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2023.106278

zbMATH Keywords

transportation problemdecomposition heuristicvariable neighborhood with proximity search

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Proximity search for 0--1 mixed-integer convex programming
• A matheuristic for the two-stage fixed-charge transportation problem
• BPPLIB: a library for bin packing and cutting stock problems
• Uncertain programming models for fixed charge multi-item solid transportation problem
• The assignment and loading transportation problem
• A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes
• A generic exact solver for vehicle routing and related problems
• On multi-index fixed charge bi-criterion transportation problem
• On representatives of multi-index transportation problems
• Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach
• Exact solution of network flow models with strong relaxations
• Fixed-cost transportation problems
• An approximative algorithm for the fixed-charges transportation problem
• New Methods in Mathematical Programming—The Solid Transportation Problem
• Degeneracy in fixed cost transportation problems
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
• The fixed charge problem
• Technical Note—Exact Solution of the Fixed-Charge Transportation Problem

This page was built for publication: The transportation problem with packing constraints