The transportation problem with exclusionary side constraints

DOI10.1007/S10288-007-0067-ZMaRDI QIDQ1022437zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
• The transportation problem with conflicts
• Solvability of transportation problems with exclusions
• A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints
• Topics of polyhedral combinatorics in transportation problems with exclusions

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• Approximation of the supply scheduling problem
• Exact algorithms for procurement problems under a total quantity discount structure
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Solving transportation problems with nonlinear side constraints with tabu search
• The Change-Making Problem
• 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

(18)

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

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

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