The following pages link to (Q5519710):
Displayed 50 items.
- Due dates assignment and JIT scheduling with equal-size jobs (Q976442) (← links)
- Multiple objects tracking in fluorescence microscopy (Q999327) (← links)
- An addendum on the incremental assignment problem (Q1007874) (← links)
- A scalable framework for cluster ensembles (Q1010074) (← links)
- Graph matching using the interference of continuous-time quantum walks (Q1010111) (← links)
- Jacobi's bound for independent systems of algebraic partial differential equations (Q1015368) (← links)
- Algorithms for maximum independent set in convex bipartite graphs (Q1017904) (← links)
- Matrix columns allocation problems (Q1019735) (← links)
- Maximum weight bipartite matching in matrix multiplication time (Q1035683) (← links)
- Optimal movement of mobile sensors for barrier coverage of a planar region (Q1040594) (← links)
- A case of non-convergent dual changes in assignment problems (Q1063519) (← links)
- Packings by cliques and by finite families of graphs (Q1068852) (← links)
- An efficient labeling technique for solving sparse assignment problems (Q1071650) (← links)
- Scaling algorithms for network problems (Q1079135) (← links)
- Improving the Hungarian assignment algorithm (Q1085073) (← links)
- A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784) (← links)
- Primal-dual algorithms for the assignment problem (Q1095790) (← links)
- Monge sequences and a simple assignment algorithm (Q1104243) (← links)
- Entry and structures of interest groups in assignment games (Q1106743) (← links)
- On the Euclidean assignment problem (Q1108932) (← links)
- Reduction techniques providing initial groupings for Euclidean traveling salesman patching algorithms (Q1116908) (← links)
- The ``largest element first'' heuristic for the maximization assignment problem (Q1118529) (← links)
- Time-cost tradeoff in a three-dimensional assignment problem (Q1123126) (← links)
- A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem (Q1130068) (← links)
- Efficiency and time-cost-tradeoffs in transportation problems (Q1169400) (← links)
- The complexity of computing metric distances between partitions (Q1170849) (← links)
- Revisiting the 0,1 assignment problem (Q1183142) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- The algorithmic complexity of colour switching (Q1199936) (← links)
- Auction algorithms for network flow problems: A tutorial introduction (Q1202585) (← links)
- An augmenting path method for solving linear bottleneck assignment problems (Q1244171) (← links)
- A geometrical interpretation of the Hungarian method (Q1245144) (← links)
- A neural network approach to solve the stable matching problem (Q1268167) (← links)
- An efficient algorithm for minimum-weight bibranching (Q1272485) (← links)
- Locomotive assignment with heterogeneous consists at CN North America (Q1278619) (← links)
- The \(\beta\)-assignment problems (Q1291693) (← links)
- On finding trend-free block designs (Q1300920) (← links)
- An improved general procedure for lexicographic bottleneck problems (Q1306359) (← links)
- A variation of the assignment problem (Q1309926) (← links)
- An exterior point simplex algorithm for (general) linear programming problems (Q1312781) (← links)
- Special cases of the traveling salesman problem (Q1316125) (← links)
- Parallel algorithms for the assignment and minimum-cost flow problems (Q1319670) (← links)
- The auction algorithm: A distributed relaxation method for the assignment problem (Q1320412) (← links)
- Algorithms for finding a \(K\)th best valued assignment (Q1327213) (← links)
- The invisible hand algorithm: solving the assignment problem with statistical physics (Q1338267) (← links)
- Max-min matching problems with multiple assignments (Q1359459) (← links)
- Massively parallel augmenting path algorithms for the assignment problem (Q1365535) (← links)
- An efficient P-D algorithm for shortest path problem (Q1367256) (← links)
- Scaling and structural condition numbers (Q1368765) (← links)
- The \(\beta\)-assignment problem in general graphs (Q1370666) (← links)