A Lagrangian based branch-and-bound algorithm for production-transportation problems
From MaRDI portal
Publication:5927654
DOI10.1023/A:1008373329033zbMath0985.90092OpenAlexW1827139804MaRDI QIDQ5927654
Takahito Kuno, Takahiro Utsunomiya
Publication date: 22 May 2002
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008373329033
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Transportation, logistics and supply chain management (90B06)
Related Items (13)
A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem ⋮ An iterative algorithm for two level hierarchical time minimization transportation problem ⋮ A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem ⋮ Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables ⋮ A general purpose exact solution method for mixed integer concave minimization problems ⋮ A solution technique for capacitated two-level hierarchical time minimization transportation problem ⋮ On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope ⋮ A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures ⋮ A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems ⋮ Two level hierarchical time minimizing transportation problem ⋮ Max-min sum minimization transportation problem ⋮ Lagrangian relaxation of the generic materials and operations planning model ⋮ Sufficient optimality criterion for linearly constrained, separable concave minimization problems
This page was built for publication: A Lagrangian based branch-and-bound algorithm for production-transportation problems
