scientific article; zbMATH DE number 1855676

MaRDI QIDQ4788091zbMATH OpenFDO

Authors R. M. Larin, Artem Pyatkin

Publication date 19 January 2003

zbMATH Keywords

branch-and-bound methodbilevel cooperative assignment problemnoncooperative problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 2112614
• Exact solution approaches for bilevel assignment problems
• A note on the complexity of the bilevel bottleneck assignment problem
• The computational complexity of bilevel assignment problems
• Some properties of the bilevel programming problem

Cited in

(8)

• Exact solution approaches for bilevel assignment problems
• scientific article; zbMATH DE number 2112614 (Why is no real title available?)
• A note on the complexity of the bilevel bottleneck assignment problem
• Algorithm to solve a discrete minimax problem of the arrangement of physical field sources
• The computational complexity of bilevel assignment problems
• Bilevel Programming
• The bilinear assignment problem: complexity and polynomially solvable special cases
• scientific article; zbMATH DE number 1146101 (Why is no real title available?)

This page was built for publication:

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