A strongly polynomial simplex method for the linear fractional assignment problem (Q1003483): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2007.12.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003327511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Scaling Network Simplex Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network simplex algorithm with O(\(n\)) consecutive degenerate pivots / 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: The alternating basis algorithm for assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-fractional programming. Theory, methods, applications and software. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Properties of the Network Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nonlinear Fractional Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperbolic 0-1 programming and query optimization in information retrieval / 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: Anti-stalling Pivot Rule for Linear Programs with Totally Unimodular Coefficient Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3279740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039868 / 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: A polynomial time primal network simplex algorithm for minimum cost flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: (0, 1) hyperbolic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new pivot selection rule for the network simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME ASPECTS OF LINEAR FRACTIONAL FUNCTIONALS PROGRAMMING / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for fractional assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bound problem in linear fractional functionals programming / rank
 
Normal rank

Latest revision as of 03:31, 29 June 2024

scientific article
Language Label Description Also known as
English
A strongly polynomial simplex method for the linear fractional assignment problem
scientific article

    Statements

    A strongly polynomial simplex method for the linear fractional assignment problem (English)
    0 references
    0 references
    0 references
    4 March 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    assignment problem
    0 references
    linear fractional programming
    0 references
    simplex method
    0 references
    complexity
    0 references
    strongly polynomial algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references