The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
From MaRDI portal
Publication:1848594
DOI10.1016/S0377-2217(01)00239-9zbMath0998.90007WikidataQ57570768 ScholiaQ57570768MaRDI QIDQ1848594
Publication date: 13 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (13)
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 ⋮ Exact algorithms for procurement problems under a total quantity discount structure ⋮ A matheuristic for a customer assignment problem in direct marketing ⋮ Minimum cost noncrossing flow problem on layered networks ⋮ Minimum cost flow problem with conflicts ⋮ Maximum weight perfect matching problem with additional disjunctive conflict constraints ⋮ Maximum weighted matching with few edge crossings for 2-layered bipartite graph ⋮ Assignment problem with conflicts ⋮ Exact solution algorithms for the maximum flow problem with additional conflict constraints ⋮ The transportation problem with exclusionary side constraints ⋮ Pickup and delivery problem with incompatibility constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints
- Solving transportation problems with nonlinear side constraints with tabu search
- Basis exchange characterizations for the simplex son algorithm for LP/embedded networks
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Transportation problem with nonlinear side constraints a branch and bound approach
- Solving Constrained Transportation Problems
- A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
- A primal algorithm for solving a capacitated network flow problem with additional linear constraints
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- Augmented Threaded Index Method For Network Optimization
- A tree-search algorithm for mixed integer programming problems
- Technical Note—An Improved Branch-and-Bound Method for Integer Programming
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
- Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
- A Branch-and-Bound Method for the Fixed Charge Transportation Problem
This page was built for publication: The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
