Bilevel time minimizing transportation problem
From MaRDI portal
Publication:955331
DOI10.1016/j.disopt.2008.04.004zbMath1152.90344OpenAlexW2032087379MaRDI QIDQ955331
Ankit Khandelwal, Sonia Singh, Munish C. Puri
Publication date: 19 November 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2008.04.004
Nonconvex programming, global optimization (90C26) Transportation, logistics and supply chain management (90B06)
Related Items (4)
A Cutting Plane Approach for Solving Linear Bilevel Programming Problems ⋮ Extension of particle swarm optimization algorithm for solving two-level time minimization transportation problem ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ The multi-objective multi-item just-in-time transportation problem
Cites Work
- A strongly polynomial minimum cost circulation algorithm
- Derivative evaluation and computational experience with large bilevel mathematical programs
- Dynamic noncooperative game theory
- Multi-level programming and conflict resolution
- Production and marketing decisions with multiple objectives in a competitive environment
- A strongly polynomial algorithm for the transportation problem
- An implementation of Karmarkar's algorithm for linear programming
- On the Stackelberg strategy in nonzero-sum games
- Algorithms for the minimax transportation problem
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- A solution method for the static constrained Stackelberg problem via penalty method
- Computational Difficulties of Bilevel Linear Programming
- Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem
- A min max problem
- Equilibrium programming:The path following approach and dynamics
- On two-level optimization
- Defense Applications of Mathematical Programs with Optimization Problems in the Constraints
- Technical Note—The Equivalence of Two Mathematical Programs with Optimization Problems in the Constraints
- Closed-loop Stackelberg strategies with applications in the optimal control of multilevel systems
- The bottleneck transportation problem
- Mathematical Programs with Optimization Problems in the Constraints
- A solution method for the linear static Stackelberg problem using penalty functions
- Finite exact branch-and-bound algorithms for concave minimization over polytopes
- Unnamed Item
This page was built for publication: Bilevel time minimizing transportation problem
