Exact solution approaches for bilevel assignment problems

DOI10.1007/S10589-015-9799-4MaRDI QIDQ276866zbMATH OpenOpenAlexFDO

Authors Behdad Beheshti, Oleg A. Prokopyev, Eduardo L. Pasiliao

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

zbMATH Keywords

combinatorial optimizationassignment problembilevel programming

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 1855676
• The computational complexity of bilevel assignment problems
• Exact solution approaches for bilevel lot-sizing
• Bilevel time minimizing assignment problem
• Efficient solutions for the linear bilevel programming problem
• scientific article; zbMATH DE number 2112614
• Exact solution approach for a class of nonlinear bilevel knapsack problems
• Solution of a bi-level programming problem with inexact parameters
• Exact solution approaches for a class of bilevel fractional programs

Cites work

• scientific article; zbMATH DE number 1163110 (Why is no real title available?)
• A branch-and-bound algorithm for the singly constrained assignment problem
• Algorithms for finding k-best perfect matchings
• An algorithm for ranking assignments using reoptimization
• An overview of bilevel optimization
• Assignment Problems
• Finding all minimum-cost perfect matchings in Bipartite graphs
• GRASP with path relinking for three-index assignment
• 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
• Multilevel optimization: algorithms and applications
• Nonlinear assignment problems. Algorithms and applications
• On optimality of a polynomial algorithm for random linear multidimensional assignment problem
• Pseudo-Boolean optimization
• Resource constrained assignment problems
• Solving a bilevel linear program when the inner decision maker control few variables
• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
• The computational complexity of bilevel assignment problems

Cited in

(12)

• On exact solution approaches for bilevel quadratic 0-1 knapsack problem
• scientific article; zbMATH DE number 1855676 (Why is no real title available?)
• scientific article; zbMATH DE number 2112614 (Why is no real title available?)
• A note on the complexity of the bilevel bottleneck assignment problem
• scientific article; zbMATH DE number 6303703 (Why is no real title available?)
• A note on linearized reformulations for a class of bilevel linear integer problems
• The computational complexity of bilevel assignment problems
• Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds
• Exact solution approaches for bilevel lot-sizing
• Bilevel optimization: theory, algorithms, applications and a bibliography
• A simple greedy heuristic for linear assignment interdiction
• On bilevel minimum and bottleneck spanning tree problems

Describes a project that uses

Uses Software

• Dlib-ml

This page was built for publication: Exact solution approaches for bilevel assignment problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q276866)