Polynomially solvable special cases of the quadratic bottleneck assignment problem

No abstract is available for this paper.

• Publication year

  2011

• Venue

  Journal of combinatorial optimization

• Publication date

  2011-11-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s10878-010-9333-7
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Theory and Algorithms

  2009cited by this paper
• 8. Quadratic Assignment Problems: Algorithms

  2009cited by this paper
• Generators, extremals and bases of max cones

  2006cited by this paper
• The quadratic assignment problem : theory and algorithms

  1999influential reference
• Assignment Problems

  1998cited by this paper
• Perspectives of Monge Properties in Optimization

  1996cited by this paper
• The Quadratic Assignment Problem

  1963cited by this paper
• Assignment Problems and the Location of Economic Activities

  1957cited by this paper

• QuIP: Experimental design for expensive simulators with many Qualitative factors via Integer Programming

  2025cites this paper
• Application of wearable inertial sensor in optimization of basketball player’s human motion tracking method

  2021cites this paper
• Uncertain random quadratic bottleneck assignment problem

  2019cites this paper
• Solving Quadratic Assignment Problem with Fixed Assignment (QAPFA) using Branch and Bound Approach

  2018cites this paper
• A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints

  2018cites this paper
• A turnpike approach to solving the linear bottleneck assignment problem

  2013cites this paper
• Quadratic balanced optimization problems

  2011influential citation