Random assignment problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 6118218 (Why is no real title available?)
- scientific article; zbMATH DE number 1802784 (Why is no real title available?)
- scientific article; zbMATH DE number 3932819 (Why is no real title available?)
- scientific article; zbMATH DE number 4043612 (Why is no real title available?)
- scientific article; zbMATH DE number 3564691 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 1273988 (Why is no real title available?)
- scientific article; zbMATH DE number 1281677 (Why is no real title available?)
- scientific article; zbMATH DE number 1302195 (Why is no real title available?)
- scientific article; zbMATH DE number 635066 (Why is no real title available?)
- scientific article; zbMATH DE number 714530 (Why is no real title available?)
- scientific article; zbMATH DE number 1086908 (Why is no real title available?)
- scientific article; zbMATH DE number 1163720 (Why is no real title available?)
- scientific article; zbMATH DE number 2190116 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- A Lower Bound on the Expected Cost of an Optimal Assignment
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
- A minimax assignment problem in treelike communication networks
- A multi-level bottleneck assignment approach to the bus drivers' rostering problem
- A note on asymptotic properties of the quadratic assignment problem
- A note on the asymptotic behaviour of bottleneck problems
- A proof of Parisi's conjecture on the random assignment problem
- A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment
- A survey for the quadratic assignment problem
- Algorithm and Average-value Bounds for Assignment Problems
- Algorithms for two bottleneck optimization problems
- An Algorithm for the Three-Index Assignment Problem
- An algebraic approach to assignment problems
- An algorithm to solve them ×n assignment problem in expected timeO(mn logn)
- An analysis of a decomposition heuristic for the assignment problem
- An asymptotical study of combinatorial optimization problems by means of statistical mechanics
- Approximation Theorems of Mathematical Statistics
- Assignment Problems and the Location of Economic Activities
- Assignment problems: a golden anniversary survey
- Asymptotic Properties of the Quadratic Assignment Problem
- Asymptotic behavior of the expected optimal value of the multidimensional assignment problem
- Asymptotic properties of random multidimensional assignment problems
- Asymptotic results for random multidimensional assignment problems
- Asymptotics in the random assignment problem
- Certain expected values in the random assignment problem
- Combinational optimization problems for which almost every algorithm is asymptotically optimal
- Comparison of iterative searches for the quadratic assignment problem
- Concentration of measure and isoperimetric inequalities in product spaces
- Constructive bounds and exact expectations for the random assignment problem
- Correlated and uncorrelated fitness landscapes and how to tell the difference
- GRASP with path relinking for three-index assignment
- Generating quadratic assignment test problems with known optimal permutations
- Heuristics for biquadratic assignment problems and their computational comparison
- Introduction to the replica theory of disordered statistical systems
- Landscapes and their correlation functions
- Letter to the Editor—The Multidimensional Assignment Problem
- Matchings in random regular bipartite digraphs
- Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
- Nonlinear assignment problems. Algorithms and applications
- On Approximation Methods for the Assignment Problem
- On linear programs with random costs
- On patching algorithms for random asymmetric travelling salesman problems
- On random quadratic bottleneck assignment problems
- On the Expected Value of a Random Assignment Problem
- On the expected optimal value of random assignment problems: Experimental results and open questions
- On the expected value of the minimum assignment
- On the landscape ruggedness of the quadratic assignment problem
- On the number of local minima for the multidimensional assignment problem
- On the quality of local search for the quadratic assignment problem
- Order statistics and the linear assignment problem
- P-Complete Approximation Problems
- Probabilistic asymptotic properties of some combinatorial optimization problems
- Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures
- QAPLIB-A quadratic assignment problem library
- Quadratic assignment problems
- Random Assignment with Integer Costs
- Random assignment and shortest path problems
- Random multi-index matching problems
- Recent advances in the solution of quadratic assignment problems
- Selected topics on assignment problems
- Solving the multisensor data association problem.
- Stochastic Analysis of the Quadratic Assignment Problem
- The Backboard Wiring Problem: A Placement Algorithm
- The Probabilistic Analysis of a Heuristic for the Assignment Problem
- The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems
- The \(\zeta(2)\) limit in the random assignment problem
- The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach
- The asymptotic probabilistic behaviour of quadratic sum assignment problems
- The multivariate normal distribution
- The quadratic assignment problem. Theory and algorithms
- The random linear bottleneck assignment problem
- Time-slot assignment for TDMA-systems
- Tracking elementary particles near their primary vertex: A combinatorial approach
- Traffic assignment in communication satellites
Cited in
(18)- Random assignments on sequentially dichotomous domains
- Quick or cheap? Breaking points in dynamic markets
- A new greedy algorithm for the quadratic assignment problem
- Maxima and near-maxima of a Gaussian random assignment field
- On optimality of a polynomial algorithm for random linear multidimensional assignment problem
- An assignment problem and its application in education domain: a review and potential path
- Distributionally robust mixed integer linear programs: persistency models with applications
- In and out forests on combinatorial landscapes
- (Non-)obvious manipulability of rank-minimizing mechanisms
- A lower bound on the expected optimal value of certain random linear programs and application to shortest paths in directed acyclic graphs and reliability
- Random assignment problems on 2d manifolds
- Generating QAP instances with known optimum solution and additively decomposable cost function
- Application of graph-theoretic approaches to the random landscapes of the three-dimensional assignment problem
- The cost of strategy-proofness in school choice
- Random assignment under weak preferences
- Randomized allocation processes
- The random quadratic assignment problem
- The minimum perfect matching in pseudo-dimension \(0<q<1\)
This page was built for publication: Random assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953417)
