Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
From MaRDI portal
Publication:5616598
DOI10.1287/OPRE.16.3.682zbMath0214.18705OpenAlexW2011087880MaRDI QIDQ5616598
Publication date: 1968
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.16.3.682
Related Items (71)
Algorithms for finding a \(K\)th best valued assignment ⋮ Exact solution approaches for bilevel assignment problems ⋮ BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM ⋮ A Lagrangean relaxation method for the constrained assignment problem ⋮ Algorithms for finding k-best perfect matchings ⋮ Qualitative programming for selection decisions ⋮ The optimal tenement allocation for reducing traffic burden ⋮ Extreme point Quadratic Minimization Problem ⋮ Computational social choice for coordination in agent networks ⋮ A note on \(K\) best network flows ⋮ A survey on single crane scheduling in automated storage/retrieval systems ⋮ The Kth TSP is pseudopolynomial when TSP is polynomial ⋮ An efficient procedure for finding best compromise solutions to the multi-objective assignment problem ⋮ k-Best constrained bases of a matroid ⋮ Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem ⋮ k-optimal solution sets for some polynomially solvable scheduling problems ⋮ On ranking of feasible solutions of a bottleneck linear programming problem ⋮ Extending single tolerances to set tolerances ⋮ Heuristic enhancements of the search for the generation of all perfect matchings ⋮ Evaluation and Enumeration Problems for Regular Path Queries ⋮ Polynomial-delay and polynomial-space enumeration of large maximal matchings ⋮ Maximum travelling salesman problem. I ⋮ Degree switching operations in networks and large scale systems assignment problems ⋮ Solution Enumeration by Optimality in Answer Set Programming ⋮ A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM ⋮ Ranking arborescences in O(Km log n) time ⋮ Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs ⋮ Obtaining approximately optimal and diverse solutions via dispersion ⋮ Group target tracking via jointly optimizing group partition and association ⋮ Motion tracking as a constrained optimization problem. ⋮ An indirect single-position coordinate determination method considering motion invariants under singular measurement errors ⋮ A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints ⋮ A fuzzy model for NMT word alignment using quasi-perfect matching ⋮ A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives ⋮ Probabilistic analysis of solving the assignment problem for the traveling salesman problem ⋮ On the stochastic complexity of the asymmetric traveling salesman problem ⋮ Extremal values of global tolerances in combinatorial optimization with an additive objective function ⋮ Monte Carlo localisation of a mobile robot using a Doppler-azimuth radar ⋮ Multiframe many-many point correspondence for vehicle tracking in high density wide area aerial videos ⋮ Critical edges for the assignment problem: complexity and exact resolution ⋮ The traveling salesman problem: An overview of exact and approximate algorithms ⋮ Some assignment problems arising from multiple target tracking ⋮ The multiple-robot assembly plan problem ⋮ A tolerance-based heuristic approach for the weighted independent set problem ⋮ Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem ⋮ An algorithm for ranking assignments using reoptimization ⋮ A ranked linear assignment approach to Bayesian classification ⋮ Probabilistic Analysis of Assignment Ranking: The Traveling Salesman Problems ⋮ Extended convex hull ⋮ An algorithm for determining all extreme points of a convex polytope ⋮ Graphical models ⋮ Visual tracking with automatic motion model switching ⋮ Calibrating the Gaussian multi-target tracking model ⋮ Erratum to ``An algorithm for ranking assignments using reoptimization [Computers \& Operations Research 35 (2008) 3714-3726] ⋮ A survey of literature on automated storage and retrieval systems ⋮ An approach for solving a class of transportation scheduling problems ⋮ An algorithm for then×n optimum assignment problem ⋮ Trapezoidal matrices and the bottleneck assignment problem ⋮ Resource constrained assignment problems ⋮ A min max problem ⋮ An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment ⋮ Transducing Markov sequences ⋮ Forbidden Vertices ⋮ On finding the K best cuts in a network ⋮ A variant of time minimizing assignment problem ⋮ Ranking scalar products to improve bounds for the quadratic assignment problem ⋮ Retrieval sequencing for unit-load automated storage and retrieval systems with multiple openings ⋮ Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions ⋮ Adjacency of the best and second best valued solutions in combinatorial optimization problems ⋮ Establishing motion correspondence using extended temporal scope ⋮ Finding all the perfect matchings in bipartite graphs
This page was built for publication: Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
