scientific article; zbMATH DE number 3989103
zbMATH Open0611.90073MaRDI QIDQ3751373FDOQ3751373
Authors: Silvano Martello, Paolo Toth 
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
surveycomputational complexityexact algorithmslinear assignment problemsaverage performanceApproximate algorithmsrandomly generated test problemsNP-hard cases
Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cited In (53)
- Title not available (Why is that?)
- Generalized pole placement via static output feedback: a methodology based on projections
- Two kinds of constrained assignment problems
- The \(k\)-cardinality assignment problem
- Repulsive assignment problem
- Title not available (Why is that?)
- On dual solutions of the linear assignment problem
- Computing fair and bottleneck matchings in geometric graphs
- Selected topics on assignment problems
- A survey of algorithms for the generalized assignment problem
- On the linear assignment problem for special matrices
- Single-machine scheduling with supporting tasks
- Title not available (Why is that?)
- New assignment problem for decision making
- Prioritizing replenishments of the piece picking area
- Heuristic and exact algorithms for the simultaneous assignment problem
- Some recent results in the analysis of greedy algorithms for assignment problems
- Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study
- Nonlinear assignment problems. Algorithms and applications
- LoCoMotif: discovering time-warped motifs in time series
- Computing improved optimal solutions to max-min flexible constraint satisfaction problems
- A distributed exact algorithm for the multiple resource constrained sequencing problem
- A Minimum-Cost Analysts Assignment Model for Asset Evaluation of Insolvent Saving and Loan Institutions
- Assignment Problems
- On multi-index assignment polytopes
- Spatio-temporal multi-robot routing
- Title not available (Why is that?)
- An algorithm for ranking assignments using reoptimization
- Title not available (Why is that?)
- Exact algorithms for the imbalanced time minimizing assignment problem
- Minimum deviation and balanced optimization: A unified approach
- Title not available (Why is that?)
- Technical Note—A Note on Parametric Analysis in Linear Assignment
- Iterative state-space reduction for flexible computation
- Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
- A robust heuristic for the generalized assignment problem
- A note on the complexity of the asymmetric traveling salesman problem
- A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
- Title not available (Why is that?)
- Effective algorithm and heuristic for the generalized assignment problem.
- A note on the parity assignment problem
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems
- A labeling algorithm to solve the assignment problem
- A new model and hybrid approach for large scale inventory routing problems
- The constrained minimax linear assignment problem
- Worst case examples of an exterior point algorithm for the assignment problem
- Solving the rectangular assignment problem and applications
- Constrained weighted matchings and edge coverings in graphs
- A genetic algorithm for the generalised assignment problem
- Linear assignment procedures
- Statistical applications of linear assignment
- Algorithms and codes for dense assignment problems: The state of the art
- Title not available (Why is that?)
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 Q3751373)
