An efficient solution approach to capacitated bilevel time minimizing transportation problem
From MaRDI portal
Cites work
- A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem
- A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies
- A priority based assignment problem
- A solution method for the linear static Stackelberg problem using penalty functions
- A solution method for the static constrained Stackelberg problem via penalty method
- A solution technique for capacitated two-level hierarchical time minimization transportation problem
- A strongly polynomial algorithm for the transportation problem
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- A strongly polynomial minimum cost circulation algorithm
- Algorithms for the minimax transportation problem
- An alternate approach to solve two-level priority based assignment problem
- An efficient algorithm for two-stage capacitated time minimization transportation problem with restricted flow
- An improved algorithm for two stage time minimization assignment problem
- An iterative algorithm for two level hierarchical time minimization transportation problem
- An iterative solution technique for capacitated two-stage time minimization transportation problem
- An iterative solution technique to minimize the average transportation cost of capacitated transportation problem with bounds on rim conditions
- Bilevel time minimizing assignment problem
- Bilevel time minimizing transportation problem
- Capacitated two-stage time minimization transportation problem
- Capacitated two-stage time minimization transportation problem with restricted flow
- Closed-loop Stackelberg strategies with applications in the optimal control of multilevel systems
- Computational Difficulties of Bilevel Linear Programming
- Defense Applications of Mathematical Programs with Optimization Problems in the Constraints
- Derivative evaluation and computational experience with large bilevel mathematical programs
- Dynamic noncooperative game theory
- Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem
- Equilibrium programming:The path following approach and dynamics
- Finite exact branch-and-bound algorithms for concave minimization over polytopes
- scientific article; zbMATH DE number 978735 (Why is no real title available?)
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- Mathematical Programs with Optimization Problems in the Constraints
- Multi-level programming and conflict resolution
- Network flows. Theory, algorithms, and applications.
- On the Stackelberg strategy in nonzero-sum games
- On two-level optimization
- Production and marketing decisions with multiple objectives in a competitive environment
- Task preference-based bottleneck assignment problem
- Technical Note—The Equivalence of Two Mathematical Programs with Optimization Problems in the Constraints
- The bottleneck transportation problem
- The distribution of a product from several sources to numerous localities.
- The steepest descent direction for the nonlinear bilevel programming problem
- Three-phase time minimization transportation problem
This page was built for publication: An efficient solution approach to capacitated bilevel time minimizing transportation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310965)
