A set covering reformulation of the pure fixed charge transportation problem (Q1317046): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degeneracy in fixed cost transportation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A restricted Lagrangean approach to the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-cost transportation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Covering and Involutory Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pure fixed charge transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on flows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Exact Solution of the Fixed-Charge Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fixed charge problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximative algorithm for the fixed-charges transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some computational results of using the Ahrens—Finke method for handling degeneracy in fixed charge transportation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Fixed Charge Problem by Ranking the Extreme Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid Linear Inequalities for Fixed Charge Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0166-218x(92)00177-n / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2045250339 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:46, 30 July 2024

scientific article
Language Label Description Also known as
English
A set covering reformulation of the pure fixed charge transportation problem
scientific article

    Statements

    A set covering reformulation of the pure fixed charge transportation problem (English)
    0 references
    0 references
    0 references
    17 November 1994
    0 references
    Lagrangean duality
    0 references
    pure fixed charge transportation problem
    0 references
    set covering
    0 references
    minimum cost network flow
    0 references
    heuristic
    0 references
    lower bound
    0 references
    branch-and- bound
    0 references

    Identifiers