Two level hierarchical time minimizing transportation problem
From MaRDI portal
Publication:1769948
DOI10.1007/BF02578964zbMath1114.90106OpenAlexW2016509358MaRDI QIDQ1769948
Publication date: 4 April 2005
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02578964
global optimizationhierarchical optimizationconcave minimization problemtime minimizing transportation problem
Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27)
Related Items (11)
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 ⋮ A solution technique for capacitated two-level hierarchical time minimization transportation problem ⋮ An Iterative Solution Technique to Minimize the Average Transportation Cost of Capacitated Transportation Problem with Bounds on Rim Conditions ⋮ CAPACITATED TWO-STAGE TIME MINIMIZATION TRANSPORTATION PROBLEM ⋮ Analyzing a two-staged multi-objective transportation problem under quantity dependent credit period policy using \(q\)-fuzzy number ⋮ A priority based time minimization transportation problem ⋮ An iterative solution technique for capacitated two-stage time minimization transportation problem ⋮ Extension of particle swarm optimization algorithm for solving two-level time minimization transportation problem ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Personnel scheduling and supplies provisioning in emergency relief operations
Cites Work
- A strongly polynomial minimum cost circulation algorithm
- Dynamic noncooperative game theory
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
- Production and marketing decisions with multiple objectives in a competitive environment
- An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
- A new dual based procedure for the transportation problem
- A strongly polynomial algorithm for the transportation problem
- A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
- A decomposition algorithm for solving certain classes of production-transportation problems with concave production cost
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Solving a Freight Transport Problem Using Facility Location Techniques
- Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem
- A min max problem
- Defense Applications of Mathematical Programs with Optimization Problems in the Constraints
- Closed-loop Stackelberg strategies with applications in the optimal control of multilevel systems
- Improved Algorithms for Bipartite Network Flow
- Some remarks on the time transportation problem
- Time‐minimizing transportation problems
- The bottleneck transportation problem
- A Lagrangian based branch-and-bound algorithm for production-transportation problems
- Finite exact branch-and-bound algorithms for concave minimization over polytopes
This page was built for publication: Two level hierarchical time minimizing transportation problem
