Transportation problem with nonlinear side constraints a branch and bound approach

DOI10.1007/BF01417216zbMath0764.90055OpenAlexW2126743588MaRDI QIDQ4007119

No author found.

Publication date: 27 September 1992

Published in: [https://portal.mardi4nfdi.de/entity/Q3199221 ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01417216

zbMATH Keywords

branch and boundheuristictransportation problemnonlinear side constraints

Mathematics Subject Classification ID

Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (10)

The transportation problem with conflicts ⋮ The Red-Blue transportation problem ⋮ Solving transportation problems with nonlinear side constraints with tabu search ⋮ Branch-and-cut for linear programs with overlapping SOS1 constraints ⋮ Minimum cost flow problem with conflicts ⋮ Genetic algorithm based fuzzy stochastic transportation programming problem with continuous random variables ⋮ 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 ⋮ The transportation problem with exclusionary side constraints and two branch-and-bound algorithms

Cites Work

• Unnamed Item
• Reoptimization procedures for bounded variable primal simplex network algorithms
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Solution of constrained generalized transportation problems using the pivot and probe algorithm
• Equitable Demand Adjustment for Infeasible Transportation Problems
• Solving Constrained Transportation Problems

This page was built for publication: Transportation problem with nonlinear side constraints a branch and bound approach