Skip to main content
8 votes

A variant of weighted perfect bipartite matching

I don't think the monotonicity will help much, for the following reason. Start with any arbitrary assignment problem. Add a constant amount $K$ to $c_{i2}$ for all $i$, with $K$ sufficiently large to ...
prubin's user avatar
  • 39.8k
7 votes

partitioning hub assignment models

Formulating as one big problem requires more memory, some way to recognize that the problem decomposes into disjoint subproblems, and some way to then solve the subproblems independently. At least ...
RobPratt's user avatar
  • 33.1k
6 votes

Terrain Ruggedness Index for optimization problem

Yes. The ruggedness of a landscape is a measure of how much variability is observed between neighbouring solutions, and it can be computed using the landscape correlation function. Rugged landscapes (...
Alberto Franzin's user avatar
4 votes

partitioning hub assignment models

Cost matrixes are discussed in the book: "Assignment Problems" by Rainer Burkard, Mauro Dell'Amico, Silvano Martello (on pages 73, and 200, etc.). Yes, some parts would be unconnected (most ...
Rob's user avatar
  • 2,130
3 votes

How to determine least time required to complete all tasks?

Minimizing the sum of all assignments: this is the classical version of the assignment problem. The Hungarian algorithm solves it in polynomial time. Minimizing the maximum of all assignments: this ...
fontanf's user avatar
  • 2,643

Only top scored, non community-wiki answers of a minimum length are eligible