Exact solution approaches for bilevel assignment problems
From MaRDI portal
Publication:276866
DOI10.1007/s10589-015-9799-4zbMath1343.90046OpenAlexW2241389707MaRDI QIDQ276866
Eduardo L. Pasiliao, Behdad Beheshti, Oleg A. Prokopyev
Publication date: 4 May 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-015-9799-4
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (5)
On exact solution approaches for bilevel quadratic 0-1 knapsack problem ⋮ Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds ⋮ A note on linearized reformulations for a class of bilevel linear integer problems ⋮ A simple greedy heuristic for linear assignment interdiction ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Uses Software
Cites Work
- Unnamed Item
- On optimality of a polynomial algorithm for random linear multidimensional assignment problem
- Pseudo-Boolean optimization
- The computational complexity of bilevel assignment problems
- Algorithms for finding k-best perfect matchings
- Solving a bilevel linear program when the inner decision maker control few variables
- Resource constrained assignment problems
- Multilevel optimization: algorithms and applications
- Nonlinear assignment problems. Algorithms and applications
- A branch-and-bound algorithm for the singly constrained assignment problem
- An overview of bilevel optimization
- An algorithm for ranking assignments using reoptimization
- GRASP with Path Relinking for Three-Index Assignment
- Assignment Problems
- Finding all minimum-cost perfect matchings in Bipartite graphs
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
This page was built for publication: Exact solution approaches for bilevel assignment problems
