The transportation problem with exclusionary side constraints
DOI10.1007/S10288-007-0067-ZzbMATH Open1179.90233OpenAlexW2125513175MaRDI QIDQ1022437FDOQ1022437
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
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
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
- Solving transportation problems with nonlinear side constraints with tabu search
- Transportation problem with nonlinear side constraints a branch and bound approach
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Exact algorithms for procurement problems under a total quantity discount structure
- Approximation of the supply scheduling problem
- The Change-Making Problem
Cited In (18)
- The transportation problem with conflicts
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- Pickup and delivery problem with incompatibility constraints
- The Red-Blue transportation problem
- The maximum flow problem with disjunctive constraints
- 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
- 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
- A hybrid dynamic programming for solving fixed cost transportation with discounted mechanism
- Solvability of transportation problems with exclusions
- On the transportation problem with market choice
- Some aspects on solving transportation problem
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
- Assignment problem with conflicts
- Maximum weight perfect matching problem with additional disjunctive conflict constraints
- Exact methods for combinatorial auctions. (Abstract of Thesis)
- Minimum cost noncrossing flow problem on layered networks
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)
