The transportation problem with exclusionary side constraints

DOI10.1007/s10288-007-0067-zzbMath1179.90233OpenAlexW2125513175MaRDI QIDQ1022437

Frits C. R. Spieksma, Dries R. Goossens

Publication date: 22 June 2009

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/122704

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

The transportation problem with conflicts ⋮ The Red-Blue transportation problem ⋮ The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach ⋮ A hybrid dynamic programming for solving fixed cost transportation with discounted mechanism ⋮ The maximum flow problem with disjunctive constraints ⋮ Minimum cost noncrossing flow problem on layered networks ⋮ Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand ⋮ Minimum cost flow problem with conflicts ⋮ Maximum weight perfect matching problem with additional disjunctive conflict constraints ⋮ Exact methods for combinatorial auctions. (Abstract of Thesis) ⋮ Assignment problem with conflicts ⋮ Exact solution algorithms for the maximum flow problem with additional conflict constraints ⋮ Some aspects on solving transportation problem ⋮ Pickup and delivery problem with incompatibility constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact algorithms for procurement problems under a total quantity discount structure
• Approximation of the supply scheduling problem
• The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
• Solving transportation problems with nonlinear side constraints with tabu search
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Transportation problem with nonlinear side constraints a branch and bound approach
• The Change-Making Problem