Approximating reduced costs under degeneracy in a network flow problem with side constraints (Q5689761): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
label / enlabel / en
 
Approximating reduced costs under degeneracy in a network flow problem with side constraints
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199607)27:4<267::aid-net2>3.0.co;2-e / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078775156 / rank
 
Normal rank
Property / title
 
Approximating reduced costs under degeneracy in a network flow problem with side constraints (English)
Property / title: Approximating reduced costs under degeneracy in a network flow problem with side constraints (English) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:46, 30 July 2024

scientific article; zbMATH DE number 961879
Language Label Description Also known as
English
Approximating reduced costs under degeneracy in a network flow problem with side constraints
scientific article; zbMATH DE number 961879

    Statements

    0 references
    7 January 1997
    0 references
    0 references
    optimal simplex tableau
    0 references
    degeneracy
    0 references
    network flow problems with side constraints
    0 references
    Lagrangian relaxation
    0 references
    minimum-cost network flow algorithm
    0 references
    shortest path algorithm
    0 references
    0 references
    Approximating reduced costs under degeneracy in a network flow problem with side constraints (English)
    0 references