The Red-Blue transportation problem

DOI10.1016/J.EJOR.2014.02.055zbMATH Open1338.90256OpenAlexW2132079722MaRDI QIDQ296580FDOQ296580

Authors Wim Vancroonenburg, Frits C. R. Spieksma, F. Della Croce, Dries R. Goossens

Publication date 23 June 2016

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

Full work available at URL https://doi.org/10.1016/j.ejor.2014.02.055

zbMATH Keywords

complexityinteger programmingapproximationtransportation problemexclusionary constraints

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• The transportation problem with exclusionary side constraints
• The transportation problem with conflicts
• Publication:4952637
• scientific article; zbMATH DE number 1594585
• The constrained bottleneck transportation problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Combinatorial aspects of construction of competition Dutch professional football leagues
• Grey transportation problem
• Local search and lower bounds for the patient admission scheduling problem
• Solving transportation problems with nonlinear side constraints with tabu search
• The fixed charge problem
• The maximum flow problem with disjunctive constraints
• The transhipment problem
• The transportation problem with exclusionary side constraints
• The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
• Transportation problem with nonlinear side constraints a branch and bound approach

Cited in

(9)

• Grey transportation problem
• The transportation problem with conflicts
• Structural insights about avoiding transfers in the patient-to-room assignment problem
• Pickup and delivery problem with incompatibility constraints
• Patient admission scheduling problems with uncertain length of stay: optimization models and an efficient matheuristic approach
• An efficient matheuristic for offline patient-to-bed assignment problems
• One transfer per patient suffices: structural insights about patient-to-room assignment
• Compatibility of short and long term objectives for dynamic patient admission scheduling
• A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies

This page was built for publication: The Red-Blue transportation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296580)