The singly constrained assignment problem: An AP basis algorithm (Q1908532): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Lagrangean relaxation method for the constrained assignment problem / 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: Matching problems with generalized upper bound side constraints / 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: A new algorithm for the assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The auction algorithm: A distributed relaxation method for the assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing the Simplex Method: The Initial Basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Assignment Problem by Relaxation / 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: Q3968758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Constrained Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A streamlined simplex approach to the singly constrained transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource-Constrained Assignment Scheduling / rank
 
Normal rank

Latest revision as of 10:56, 24 May 2024

scientific article
Language Label Description Also known as
English
The singly constrained assignment problem: An AP basis algorithm
scientific article

    Statements

    The singly constrained assignment problem: An AP basis algorithm (English)
    0 references
    0 references
    0 references
    0 references
    31 March 1996
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    specialized primal simplex algorithm
    0 references
    near optimal integer solutions
    0 references