Algorithms and codes for dense assignment problems: The state of the art (Q1962018): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Scaling Network Simplex Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequential dual simplex algorithm for the linear assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genuinely polynomial primal simplex algorithm for the assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel shortest augmenting path algorithm for the assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hirsch Conjecture for Dual Transportation Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signature Methods for the Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A competitive (dual) simplex method for the assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The alternating basis algorithm for assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming on Cray Supercomputers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for the assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual coordinate step methods for linear network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel synchronous and asynchronous implementations of the auction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of large-scale, asymmetric traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual algorithms for the assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4276004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient cost scaling algorithm for the assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear-Time Parallel Algorithms for Matching and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Minimum-Cost Circulations by Successive Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Polynomial Simplex Method for the Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Hungarian assignment algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A shortest augmenting path algorithm for dense and sparse linear assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A “Hard” Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surveys in combinatorial optimization. (Based on a series of lectures given at the School on Combinatorial Optimization, held at the Federal University of Rio de Janeiro, Brazil, July 8-19, 1985) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the simplex algorithm for networks and generalized networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: New scaling algorithms for the assignment and minimum mean cycle problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4283454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational analysis of the auction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and semi-assignment problems: A core oriented approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of two algorithms for the assignment problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(99)00172-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2104363966 / rank
 
Normal rank

Latest revision as of 08:52, 30 July 2024

scientific article
Language Label Description Also known as
English
Algorithms and codes for dense assignment problems: The state of the art
scientific article

    Statements

    Algorithms and codes for dense assignment problems: The state of the art (English)
    0 references
    0 references
    0 references
    30 January 2000
    0 references
    linear assignment problem
    0 references
    experimental evaluation
    0 references
    comparison of algorithms
    0 references
    dense matrices
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers